 Euler circuit criterion

A finite graph with at least three vertices is Eulerian exactly when it is connected and every vertex has even degree. A maximal trail closes by parity; closed trails based at vertices with unused incident edges can then be spliced together.