A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball and Coxeter 1987, pp. 265-266).

Eulerian cycle | graph edge | graph vertex | Hamiltonian cycle | Tait coloring