Discrete Applied Mathematics · 1998 · 62 citations · 8 references
Natural SciencesMathematicsCombinatoricsComputational GeometryComputational ComplexityGraph AlgorithmsGraph ColoringGraph TheoryStructural ComplexityColoring TheoremsComputational Complexity Of Graph AlgorithmsGraph Coloring Complexity
8
Some simplified NP-complete graph problems
M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations
The Complexity of Near-Optimal Graph Coloring
M. R. Garey, David S. Johnson · Journal of the ACM · 1976 · 326 citations · Full text
Peter L. Hammer, Bruno Simeone · COMBINATORICA · 1981 · 211 citations