1. Chen, B.-L., Lih, K.-W., Wu, P.-L.: Equitable coloring and the maximum degree. Eur. J. Combin. 15, 443–447 (1994)
2. Erdős, P.: Problem 9, In: M. Fiedler, editor, Theory of Graphs and Its Applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159 (1964)
3. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congressus Numerantium 26, 125–127 (1979)
4. Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349, 22–30 (2005)
5. Garey, M.R., Johnson, D.S.: Comupters and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York (1979)