 Eulerian cycle

A closed walk in a graph that traverses each edge exactly once. Vertices may be revisited; the restriction concerns edges.