Standard Article

Eulerian Path and Tour Problems

  1. Srimathy Mohan

Published Online: 15 AUG 2011

DOI: 10.1002/9780470400531.eorms1048

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Mohan, S. 2011. Eulerian Path and Tour Problems. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. Arizona State University, Department of Supply Chain Management, W.P. Carey School of Business, Tempe, Arizona

Publication History

  1. Published Online: 15 AUG 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.

Keywords:

  • Eulerian graphs;
  • Eulerian tours;
  • directed graphs;
  • undirected graphs;
  • mixed graphs