The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
- 1 August 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (3) , 529-539
- https://doi.org/10.1137/0211042
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Bridges and Hamiltonian circuits in planar graphsAequationes mathematicae, 1977
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Computational complexity of random access stored program machinesTheory of Computing Systems, 1971
- Correspondences between plane trees and binary sequencesJournal of Combinatorial Theory, 1970
- Random-Access Stored-Program Machines, an Approach to Programming LanguagesJournal of the ACM, 1964
- Computability of Recursive FunctionsJournal of the ACM, 1963
- A theorem on planar graphsTransactions of the American Mathematical Society, 1956