Add to ORKGAbstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without 4-cycles, then G is equitably m-colorable for any m ≥ ∆.
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced ...
AbstractLet Δ denote the maximum degree of a graph. Fiamčík first and then Alon et al. again conject...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
First, let a graph be a set of vertices (points) and a set of edges (lines) connecting these vertice...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractIn [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Compu...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractLet Δ(G) denote the maximum degree of a graph G. The equitable Δ-coloring conjecture asserts...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced ...
AbstractLet Δ denote the maximum degree of a graph. Fiamčík first and then Alon et al. again conject...
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
First, let a graph be a set of vertices (points) and a set of edges (lines) connecting these vertice...
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
In this paper we prove that every planar graph without 4, 5 and 8-cycles is 3-colorable
AbstractA graph G is equitably k-choosable if for any k-uniform list assignment L, there exists an L...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
AbstractIn [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Compu...
AbstractIn this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-c...
AbstractIn this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorabl...
AbstractA graph G is equitably k-choosable if, for any k-uniform list assignment L, G is L-colorable...
AbstractLet Δ(G) denote the maximum degree of a graph G. The equitable Δ-coloring conjecture asserts...
AbstractPlanar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be...
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced ...
AbstractLet Δ denote the maximum degree of a graph. Fiamčík first and then Alon et al. again conject...