[MN08]	K. Mizuno, S. Nishihara (2008). Constructive generation of very hard 3-colorability instances. Discrete Applied Mathematics, vol. 156, no. 2, pp. 218-229. [ bib | DOI ]
[Chv04]	V. Chvátal (2004). Coloring the queen graphs. Web repository (last visited July 2005). [ bib | .html ]
[ZKW03]	A. Zymolka, A. M. C. A. Koster, R. Wessäly (2003). Transparent optical network design with sparse wavelength conversion. In Proceedings of the 7th IFIP Working Conference on Optical Network Design & Modelling, pp. 61-80. Budapest, Hungary. [ bib ]
[GS02]	C. Gomes, D. Shmoys (2002). Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 22-39. Ithaca, New York, USA. [ bib ]
[HS02]	S. Hossain, T. Steihaug (2002). Graph coloring in the estimation of mathematical derivatives. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 9-16. Ithaca, New York, USA. [ bib ]
[MN02]	K. Mizuno, S. Nishihara (2002). Toward Ordered Generation of Exceptionally Hard Instances for Graph 3-Colorability. In D. S. Johnson, A. Mehrotra, M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 1-8. Ithaca, New York, USA. [ bib ]
[CD02b]	M. Caramia, P. Dell'Olmo (2002). K-Insertions graphs: a proposal of a new class of benchmarks. Manuscript. [ bib ]
[CD02a]	M. Caramia, P. Dell'Olmo (2002). K-FullIns graphs: a proposal of a new class of benchmarks. Manuscript. [ bib ]
[LC96]	G. Lewandowski, A. Condon (1996). Experiments with parallel graph coloring heuristics and applications of graph coloring. vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 309-334. American Mathematical Society, Providence, RI, USA. [ bib ]
[MT96]	A. Mehrotra, M. Trick (1996). A Column Generation Approach for Graph Coloring. INFORMS Journal On Computing, vol. 8, no. 4, pp. 344-354. [ bib ]
[CBP95]	J. Culberson, A. Beacham, D. Papp (1995). Hiding our Colors. In Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, pp. 31-42. Cassis, France. [ bib | .html ]
[JAMS91]	D. S. Johnson, C. R. Aragon, L. A. McGeoch, C. Schevon (1991). Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, vol. 39, no. 3, pp. 378-406. [ bib ]