The Planar Hamiltonian Circuit Problem is NP-Complete
- 1 December 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (4), 704-714
- https://doi.org/10.1137/0205049
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On Hamiltonian CircuitsJournal of the London Mathematical Society, 1946
- 10. Remarks on the previous CommunicationProceedings of the Royal Society of Edinburgh, 1880