Skip to main content

Chapter 13
Euler and Hamilton

Some sorts of walks through a graph are particularly important for routing problems. We will be considering some of these in this chapter.

Summary.
  • algorithms for finding Euler tours and trails

  • Important definitions:

    • closed walk, trail, tour

    • Euler tour, Euler trail

    • Hamilton cycle, Hamilton path

    • minimum valency, maximum valency

    • closure of a graph

  • Notation:

    • \(\displaystyle \delta, \Delta\)