Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre The planar Hamiltonian circuit problem is NP-complete. (English) Zbl 0346.05110 SIAM J. Comput. 5, 704-714 (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 179 Documents MSC: 05C35 Extremal problems in graph theory PDFBibTeX XMLCite \textit{M. R. Garey} et al., SIAM J. Comput. 5, 704--714 (1976; Zbl 0346.05110) Full Text: DOI