Definition:Eulerian Graph

A Eulerian circuit is a circuit that passes through every vertex of a graph and uses every edge exactly once.

A graph is called Eulerian if it contains a Eulerian circuit.