The edge Hamiltonian path problem is NP-complete

Garey, 1979 Garey, 1976, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5, 704, 10.1137/0205049 Gavril, 1972, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM J. Comput., 1, 180, 10.1137/0201013 Harary, 1969 Karp, 1972, Reducibility among combinatorial problems, 83 Krishnamoorty, 1975, An NP-hard problem in bipartite graph, SIGACT News, 7, 26, 10.1145/990518.990521 Sahni, 1978, Combinatorial problems: reducibility and approximation, Oper. Res., 26, 718, 10.1287/opre.26.5.718 Yannakakis, 1978, Node-and edge-deletion NP-complete problems, 253