An Eulerian Circuit is a closed path in a graph that visits every edge exactly once and returns to the starting vertex. A connected graph has an Eulerian Circuit if and only if every vertex has an even degree.