On equitable Δ-coloring of graphs with low average degree

Authors:
A. V. Kostochka;K. Nakprasit
Affiliations:
Department of Mathematics, The University of Illinois, Urbana, IL and Institute of Mathematics, Novosibirsk, Russia;Department of Mathematics, The University of Illinois, Urbana, IL
Venue:
Theoretical Computer Science - Graph colorings
Year:
2005

Citing 10
Cited 5

An existential problem of a weight-controlled subset and its application to school timetable construction

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Equitable coloring and the maximum degree

European Journal of Combinatorics
Mutual exclusion scheduling

Theoretical Computer Science
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 with conflicts, and applications to traffic signal control

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
The infamous upper tail

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Equitable Colourings of d-degenerate Graphs

Combinatorics, Probability and Computing
A list analogue of equitable coloring

Journal of Graph Theory

An Ore-type theorem on equitable coloring

Journal of Combinatorial Theory Series B
Ore-type versions of Brooks' theorem

Journal of Combinatorial Theory Series B
Equitable colorings of Kronecker products of graphs

Discrete Applied Mathematics
Equitable colorings of Cartesian products of graphs

Discrete Applied Mathematics
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. Hajnal and Szemerédi proved that every graph with maximum degree Δ is equitably k-colorable for every k ≥ Δ + 1. Chen, Lih, and Wu conjectured that every connected graph with maximum degree Δ ≥ 3 distinct from KΔ+1 and KΔ,Δ is equitably Δ-colorable. This conjecture has been proved for graphs in some classes such as bipartite graphs, outerplanar graphs, graphs with maximum degree 3, interval graphs We prove that this conjecture holds for graphs with average degree at most Δ/5.