Equitable coloring and the maximum degree

DOI10.1006/eujc.1994.1047zbMath0809.05050OpenAlexW2041206070MaRDI QIDQ1337614

Bor-Liang Chen, Pou-Lin Wu, Ko-Wei Lih

Publication date: 30 November 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1047

zbMATH Keywords

connected graphmaximum vertex degreeequitable \(h\)-coloring conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Equitable chromatic number of weak modular product of Some graphs, On the equitable total chromatic number of cubic graphs, On bipartization of cubic graphs by removal of an independent set, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring, Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs, Equitable coloring parameters of certain graph classes, Equitable coloring and equitable choosability of graphs with small maximum average degree, On the Corrádi-Hajnal theorem and a question of Dirac, EQUITABLE CHROMATIC NUMBER OF SOME WHEEL RELATED GRAPHS, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, On Equitable List Arboricity of Graphs, Equitable colorings of Kronecker products of graphs, Disjoint cycles and chorded cycles in a graph with given minimum degree, Equitable and equitable list colorings of graphs, Equitable colorings of corona multiproducts of graphs, Equitable vertex arboricity of 5-degenerate graphs, A greedy algorithm for the social golfer and the Oberwolfach problem, Equitable and list equitable colorings of planar graphs without 4-cycles, Equitable colorings of planar graphs without short cycles, Equitable vertex arboricity of graphs, Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines, Sharpening an ore-type version of the Corrádi-Hajnal theorem, Equitable \(\Delta\)-coloring of graphs, A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring, A note on relaxed equitable coloring of graphs, Extremal numbers for disjoint copies of a clique, Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs, On certain parameters of equitable coloring of graphs, Equivalence of two conjectures on equitable coloring of graphs, The equitable total chromatic number of the graph \(\mathrm{HM}(W_n)\), An Ore-type theorem on equitable coloring, Equitable coloring planar graphs with large girth, Equitable list colorings of planar graphs without short cycles, A refinement of a result of Corrádi and Hajnal, Equitable coloring of three classes of 1-planar graphs, Total equitable list coloring, EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS, On equitable and equitable list colorings of series-parallel graphs, Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture, Equitable partition of planar graphs, On the equitable chromatic number of complete \(n\)-partite graphs, Theoretical aspects of equitable partition of networks into sparse modules, On equitable colorings of sparse graphs, Equitable coloring of some convex polytope graphs, Ore-type versions of Brooks' theorem, A note on the equitable choosability of complete bipartite graphs, Equitable total coloring of corona of cubic graphs, On list equitable total colorings of the generalized theta graph, Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs, Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling, Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms, Equitable defective coloring of sparse planar graphs, Equitable colorings of planar graphs with maximum degree at least nine, Equitable colorings of Cartesian products of graphs, Proportional choosability: a new list analogue of equitable coloring, On the equitable choosability of the disjoint union of stars, Equitable total-coloring of subcubic graphs, Equitable colourings of Borel graphs, Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles, On equitable \(\Delta\)-coloring of graphs with low average degree