The Complexity of Near-Optimal Graph Coloring

M. R. Garey, David S. Johnson. The Complexity of Near-Optimal Graph Coloring. Journal of the ACM, 23(1):43-49, 1976. [doi]

Abstract

Abstract is missing.