A graph that has an Euler Tour

Euler Tour

A walk which traverses every edge in a graph exactly once

• A graph has an Euler Tour $⟺$
  • it is connected
  • has no vertices of degree 0
  • has at most 2 degrees of odd degree