Karp, R. M. On the computational complexity of combinatorial problems. (English) Zbl 0324.05003 Networks 5, 45-68 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 137 Documents MSC: 05-04 Software, source code, etc. for problems pertaining to combinatorics 05C15 Coloring of graphs and hypergraphs 05C35 Extremal problems in graph theory 68Q25 Analysis of algorithms and problem complexity 05C10 Planar graphs; geometric and topological aspects of graph theory 90B10 Deterministic network models in operations research PDF BibTeX XML Cite \textit{R. M. Karp}, Networks 5, 45--68 (1975; Zbl 0324.05003) Full Text: DOI OpenURL