Equitable coloring and the maximum degree
European Journal of Combinatorics
On equitable coloring of bipartite graphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A short proof of the hajnal–szemerédi theorem on equitable colouring
Combinatorics, Probability and Computing
Equitable list colorings of planar graphs without short cycles
Theoretical Computer Science
| Hi-index | 5.23 |
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 that every connected graph G with maximum degree @D=2 has an equitable coloring with @D colors, except when G is a complete graph or an odd cycle or @D is odd and G=K"@D","@D. Nakprasit proved that the conjecture holds for planar graphs with maximum degree at least 9. Zhu and Bu proved that the conjecture holds for every C"3-free planar graph with maximum degree at least 8 and for every planar graph without C"4 and C"5 with maximum degree at least 7. In this paper, we prove that the conjecture holds for planar graphs in various settings, especially for every C"3-free planar graph with maximum degree at least 6 and for every planar graph without C"4 with maximum degree at least 7; this improves or generalizes results on equitable coloring by Zhu and Bu. Moreover, we prove that the conjecture holds for every planar graph of girth at least 6 with maximum degree at least 5.