On equitable-coloring of graphs with low average degree

@inproceedings{Kostochkaa2005OnEO,
  title={On equitable-coloring of graphs with low average degree},
  author={A. V. Kostochkaa and K. Nakprasita},
  year={2005}
}
  • A. V. Kostochkaa, K. Nakprasita
  • Published 2005
7 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 9 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… CONTINUE READING