The edge Hamiltonian path problem is NP-complete
- 1 January 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (4-5) , 157-159
- https://doi.org/10.1016/0020-0190(81)90048-x
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Combinatorial Problems: Reductibility and ApproximationOperations Research, 1978
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- An NP-hard problem in bipartite graphsACM SIGACT News, 1975
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972