AbstractLet Δ(G) denote the maximum degree of a graph G. The equitable Δ-coloring conjecture asserts that a connected graph G is equitably Δ(G)-colorable if it is different from Km , C2m + 1 and K2m + 1,2m + 1 for all m ⩾ 1. This conjecture is established for graphs G satisfying Δ(G) ⩾ |G|/2 or Δ(G) ⩽ 3
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
Abstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without ...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
International audienceWe demonstrate that for every positive integer ∆, every K_4-minor-free graph w...
AbstractIn [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Compu...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
AbstractA proper vertex coloring of a graph is equitable if the sizes of its color classes differ by...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
Abstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without ...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k indepe...
AbstractIn this paper, we prove that every series–parallel graph with maximum degree Δ is equitably ...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
International audienceWe demonstrate that for every positive integer ∆, every K_4-minor-free graph w...
AbstractIn [Y. Zhang, H.P. Yap, Equitable colorings of planar graphs, J. Combin. Math. Conbin. Compu...
AbstractConsider a graph G consisting of a vertex set V(G) and an edge set E(G). Let Δ(G) and χ(G) d...
AbstractA proper vertex coloring of a graph is equitable if the sizes of its color classes differ by...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
AbstractA proper k-vertex coloring of a graph is an equitable k-coloring if the sizes of the color c...
AbstractA proper vertex coloring of a graph G is equitable if the size of color classes differ by at...
Abstract In this paper, we prove that if G is a planar graph with maximum degree ∆ ≥ 7 and without ...
DOI
Add to ORKG