Eulerian Path and Tour Problems
Srimathy Mohan · Wiley Encyclopedia of Operations Research and Management Science · 2011
Abstract A fundamental problem in arc or edge routing is determining an Eulerian path or tour in the underlying graph. An Eulerian tour is a traversal that visits every edge of the graph exactly once and every node at least once. This paper presents the history of the Eulerian tour problem; the main algorithms to find Eulerian tours in directed, undirected, and mixed Eulerian graphs; and the ongoing research topics.