A connected undirected graph has an Euler circuit (a closed walk that uses every edge exactly once) if and only if

Explanation

By Euler's theorem a closed walk through every edge exists exactly when the connected graph has all vertices of even degree; exactly two odd vertices give an Euler path, not a circuit.