Eulerian Graph

A graph where a single path can visit every edge exactly once.