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
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
On equitable Δ-coloring of graphs with low average degree
Theoretical Computer Science - Graph colorings
An Ore-type theorem on equitable coloring
Journal of Combinatorial Theory Series B
A short proof of the hajnal–szemerédi theorem on equitable colouring
Combinatorics, Probability and Computing
A fast algorithm for equitable coloring
Combinatorica
A note on relaxed equitable coloring of graphs
Information Processing Letters
| Hi-index | 0.00 |
Chen et al., conjectured that for r≥3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are Kr, r (for odd r) and Kr + 1. If true, this would be a joint strengthening of the Hajnal–Szemerédi theorem and Brooks' theorem. Chen et al., proved that their conjecture holds for r = 3. In this article we study properties of the hypothetical minimum counter-examples to this conjecture and the structure of “optimal” colorings of such graphs. Using these properties and structure, we show that the Chen–Lih–Wu Conjecture holds for r≤4. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:31–48, 2012 © 2012 Wiley Periodicals, Inc.