On Hamiltonian Walks in Graphs
S. E. Goodman, Stephen T. Hedetniemi · SIAM Journal on Computing · 1974
A Hamiltonian walk in a graph G is a closed walk of minimum length which contains every point of G. An Eulerian walk in a graph G is a closed walk of minimum length which contains every line of G. In this paper we establish several relationships between Hamiltonian and Eulerian walks. We also derive a number of bounds on the length of a Hamiltonian walk.