Test case generators and computational results for the maximum clique problem. Working paper, University of Florida, 1992. 49 A. Hertz and D. De Werra. Using tabu search techniques for graph coloring. 50 Mark Jerrum.
Large cliques elude the metropolis process.
51 David S. Johnson. Approximation algorithms for combinatorial problems. 52 David S. Johnson. Worst-case behavior og graph coloring algorithms. In Proceedings 5th Southeastern Conference on Combinatorics, Graph Theory, and Computing , pages 513-527, Winnipeg, Canada, 1974.