Discrete Mathematics, ISSN 0012-365X, 2012, Volume 312, Issue 5, pp. 1019 - 1024

In [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Comput. 27 (1998) 97–105], Zhang and Yap essentially proved that each...

Equitable colorings | Planar graphs | MATHEMATICS

Equitable colorings | Planar graphs | MATHEMATICS

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 7/2019, Volume 35, Issue 4, pp. 837 - 845

It is known that DP-coloring is a generalization of list coloring in simple graphs and many results in list coloring can be generalized in those of...

Improper colorings | Planar graphs | Mathematics | Engineering Design | Combinatorics | DP-coloring | 05C15 | MATHEMATICS | Coloring | Graphs

Improper colorings | Planar graphs | Mathematics | Engineering Design | Combinatorics | DP-coloring | 05C15 | MATHEMATICS | Coloring | Graphs

Journal Article

International Journal of Mathematics and Mathematical Sciences, ISSN 0161-1712, 2017, Volume 2017, pp. 1 - 4

Let G be a graph and ϕ:V(G)∪E(G)→{1,2,3,…,k} be a k-total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v....

Mathematical research | Graph theory | Research | Computer science | Integers | Graph coloring | Algorithms | Applied mathematics | Graphs | Combinatorics | Informatics

Mathematical research | Graph theory | Research | Computer science | Integers | Graph coloring | Algorithms | Applied mathematics | Graphs | Combinatorics | Informatics

Journal Article

Far East Journal of Mathematical Sciences, ISSN 0972-0871, 05/2016, Volume 99, Issue 10, pp. 1571 - 1582

Journal Article

Far East Journal of Mathematical Sciences, ISSN 0972-0871, 05/2016, Volume 99, Issue 10, pp. 1571 - 1571

For a graph G = (V, E), an L(i, j) -labeling is a function f from the vertex set V to the set of all nonnegative integers such that ... if ... and ... if ...,...

Functions (mathematics) | Integers | Lists | Mathematical analysis | Graphs

Functions (mathematics) | Integers | Lists | Mathematical analysis | Graphs

Journal Article

Far East Journal of Mathematical Sciences, ISSN 0972-0871, 03/2016, Volume 99, Issue 6, pp. 921 - 943

Li et al. [2] introduced the notion of a flexible coloring in hypergraphs. A flexible coloring of a hypergraph H is an assignment of list of one or more colors...

Flexible coloring | Strong coloring | Coloring | Lists | Mathematical analysis | Graphs | Lithium | Hypercubes | Graph theory

Flexible coloring | Strong coloring | Coloring | Lists | Mathematical analysis | Graphs | Lithium | Hypercubes | Graph theory

Journal Article

Discrete Mathematics, ISSN 0012-365X, 08/2018, Volume 341, Issue 8, pp. 2142 - 2150

A 2-coloring is a coloring of vertices of a graph with colors 1 and 2. Define Vi≔{v∈V(G):c(v)=i} for i=1 and 2. We say that G is (d1,d2)-colorable if G has a...

Planar graph | Cycle | Defective coloring | MATHEMATICS | SPARSE GRAPHS | MAP

Planar graph | Cycle | Defective coloring | MATHEMATICS | SPARSE GRAPHS | MAP

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 12/2012, Volume 465, pp. 21 - 27

An equitable coloring of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured...

Equitable coloring | Girth | Planar graph | Cycle | COMPUTER SCIENCE, THEORY & METHODS | MAXIMUM DEGREE

Equitable coloring | Girth | Planar graph | Cycle | COMPUTER SCIENCE, THEORY & METHODS | MAXIMUM DEGREE

Journal Article

Discrete Mathematics, ISSN 0012-365X, 02/2014, Volume 317, Issue 1, pp. 75 - 78

The strong chromatic index s′(G) of a multigraph G is the minimum integer k such that there is an edge-coloring of G with k colors in which every color class...

Subdivision | Strong chromatic index | Incidence coloring | Strong edge-coloring | INDUCED MATCHINGS | SUBSET GRAPHS | MATHEMATICS | BIPARTITE GRAPHS | Integers | Matching | Graphs | Subdivisions | Joining | Mathematical analysis

Subdivision | Strong chromatic index | Incidence coloring | Strong edge-coloring | INDUCED MATCHINGS | SUBSET GRAPHS | MATHEMATICS | BIPARTITE GRAPHS | Integers | Matching | Graphs | Subdivisions | Joining | Mathematical analysis

Journal Article

International Journal of Pure and Applied Mathematics, ISSN 1311-8080, 2012, Volume 76, Issue 1, pp. 143 - 148

Journal Article

Information Processing Letters, ISSN 0020-0190, 01/2017, Volume 117, pp. 40 - 44

A (q,r)-tree-coloring of a graph G is a q-coloring of vertices of G such that the subgraph induced by each color class is a forest of maximum degree at most r....

Complete tripartite graphs | Combinatorial problems | Vertex k-arboricity | Graph algorithms | Complete bipartite graphs | SHORT CYCLES | MAXIMUM DEGREE | PLANAR GRAPHS | LIST COLORINGS | COMPUTER SCIENCE, INFORMATION SYSTEMS | ARBORICITY | Cytokinins

Complete tripartite graphs | Combinatorial problems | Vertex k-arboricity | Graph algorithms | Complete bipartite graphs | SHORT CYCLES | MAXIMUM DEGREE | PLANAR GRAPHS | LIST COLORINGS | COMPUTER SCIENCE, INFORMATION SYSTEMS | ARBORICITY | Cytokinins

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 3/2018, Volume 34, Issue 2, pp. 349 - 354

Let $$\mathrm{col_g}(G)$$ colg(G) be the game coloring number of a given graph G. Define the game coloring number of a family of graphs $$\mathcal {H}$$ H as...

Game chromatic number | Game coloring number | Planar graph | Mathematics | Engineering Design | Combinatorics | Girth | MATHEMATICS | CHROMATIC NUMBER | PARTIAL K-TREES

Game chromatic number | Game coloring number | Planar graph | Mathematics | Engineering Design | Combinatorics | Girth | MATHEMATICS | CHROMATIC NUMBER | PARTIAL K-TREES

Journal Article

Fixed Point Theory and Applications, ISSN 1687-1820, 12/2008, Volume 2008, Issue 1, pp. 1 - 18

Using the implicit iteration and the hybrid method in mathematical programming, we prove weak and strong convergence theorems for finding common fixed points...

Mathematical and Computational Biology | Analysis | Mathematics, general | Mathematics | Applications of Mathematics | Topology | Differential Geometry | MATHEMATICS | EXTRAGRADIENT METHOD | APPROXIMATION | FIXED-POINT PROBLEMS | Convergence (Mathematics) | Hilbert space | Research | Iterative methods (Mathematics) | Methods | Mappings (Mathematics) | Banach spaces | Mathematical analysis | Optimization

Mathematical and Computational Biology | Analysis | Mathematics, general | Mathematics | Applications of Mathematics | Topology | Differential Geometry | MATHEMATICS | EXTRAGRADIENT METHOD | APPROXIMATION | FIXED-POINT PROBLEMS | Convergence (Mathematics) | Hilbert space | Research | Iterative methods (Mathematics) | Methods | Mappings (Mathematics) | Banach spaces | Mathematical analysis | Optimization

Journal Article

Ars Combinatoria, ISSN 0381-7032, 2014, Volume 113, pp. 307 - 319

A (k, t)-list assignment L of a graph G assigns a list of k colors available at each vertex v in G and vertical bar boolean OR(v is an element of V(G))...

MATHEMATICS

MATHEMATICS

Journal Article

Ars Combinatoria, ISSN 0381-7032, 2013, Volume 111, pp. 375 - 387

A (k, t)-list assignment L of a graph G is a list of k colors available at each vertex v in G such that vertical bar U-v is an element of V(G) L(v)vertical bar...

MATHEMATICS | CHOICE NUMBER | GIRTH | GRAPHS

MATHEMATICS | CHOICE NUMBER | GIRTH | GRAPHS

Journal Article

Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 07/2019

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2019

Journal Article

Information Processing Letters, ISSN 0020-0190, 01/2017, Volume 117, p. 40

A (q,r)-tree-coloring of a graph G is a q-coloring of vertices of G such that the subgraph induced by each color class is a forest of maximum degree at most...

Studies | Algorithms | Mathematical models

Studies | Algorithms | Mathematical models

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 04/2020, Volume 277, pp. 245 - 251

DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). Kim and Ozeki proved...

Cycles | List colorings | Planar graphs | DP-colorings

Cycles | List colorings | Planar graphs | DP-colorings

Journal Article

12/2018

Xu and Wu proved that if every 5-cycle of a planar graph G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. In this paper, we...

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.