Eulerian Walks in Graphs
S. E. Goodman, Stephen T. Hedetniemi · SIAM Journal on Computing · 1973
The general problem of finding the shortest edge covering walks in an arbitrary undirected graph is investigated. An exact combinatoric expression is obtained for the length of such a walk, and the graph theoretic properties of these walks are studied. Explicit solutions are exhibited for some important classes of graphs.