[Lew16]	R. Lewis (2016). A Guide to Graph Colouring: Algorithms and Applications. Springer, Berlin. ISBN 978-3-319-25728-0. [ bib | DOI ]
[MT09]	E. Malaguti, P. Toth (2009). A survey on vertex coloring problems. International Transactions in Operational Research, pp. 1-34. [ bib | DOI ]
[JMT08]	D. S. Johnson, A. Mehrotra, M. A. Trick (2008). Special issue on computational methods for graph coloring and its generalizations. Discrete Applied Mathematics, vol. 156, no. 2, pp. 145-146. [ bib | DOI ]
[CDS07]	M. Chiarandini, I. Dumitrescu, T. Stützle (2007). Stochastic Local Search Algorithms for the Graph Colouring Problem. In T. F. Gonzalez (ed.), Handbook of Approximation Algorithms and Metaheuristics, Computer & Information Science Series, pp. 63.1-63.17. Chapman & Hall/CRC, Boca Raton, FL, USA. Preliminary version available as Tech. Rep. AIDA-05-03 at Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]
[GH06]	P. Galinier, A. Hertz (2006). A survey of local search methods for graph coloring. Computers & Operations Research, vol. 33, pp. 2547-2562. [ bib | DOI ]
[JMT02]	D. S. Johnson, A. Mehrotra, M. Trick (eds.) (2002). Proceedings of the Computational Symposium on Graph Coloring and its Generalizations. Ithaca, New York, USA. [ bib ]
[PMX98]	P. Pardalos, T. Mavridou, J. Xue (1998). The graph coloring problem: A bibliographic survey, vol. 2, pp. 331-395. Kluwer Academic Publishers, Boston. [ bib ]
[JT96]	D. S. Johnson, M. Trick (eds.) (1996). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, USA. [ bib ]