On equitable Delta-coloring of graphs with low average degree

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 Szemeredi 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.

[1]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[2]  Ko-Wei Lih,et al.  Equitable Coloring and the Maximum Degree , 1994, Eur. J. Comb..

[3]  A. Tucker,et al.  Perfect Graphs and an Application to Optimizing Municipal Services , 1973 .

[4]  V. G. Vizing,et al.  New proof of brooks' theorem , 1969 .

[5]  Barry F. Smith,et al.  Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[6]  Ko-Wei Lih,et al.  On equitable coloring of bipartite graphs , 1996, Discret. Math..

[7]  Sandy Irani,et al.  Scheduling with conflicts, and applications to traffic signal control , 1996, SODA '96.

[8]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[9]  Sriram V. Pemmaraju,et al.  Equitable colorings extend Chernoff-Hoeffding bounds , 2001, SODA '01.

[10]  Ko-Wei Lih,et al.  Equitable Coloring of Graphs , 1998 .

[11]  Alexandr V. Kostochka,et al.  Equitable Colourings of d-degenerate Graphs , 2003, Combinatorics, Probability and Computing.

[12]  Svante Janson,et al.  The infamous upper tail , 2002, Random Struct. Algorithms.

[13]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[14]  D. de Werra,et al.  Chromatic optimisation: Limitations, objectives, uses, references , 1982 .

[15]  Fumio Kitagawa,et al.  An existential problem of a weight- controlled subset and its application to school timetable construction , 1988, Discret. Math..

[16]  Alexandr V. Kostochka,et al.  A list analogue of equitable coloring , 2003 .

[17]  D. West.  Introduction to Graph Theory , 1995 .

[18]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[19]  Bolyai János Matematikai Társulat,et al.  Combinatorial theory and its applications , 1970 .