On equitable -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 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. © 2005 Elsevier B.V. All rights reserved.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17]  C. V. Eynden,et al.  A proof of a conjecture of Erdös , 1969 .