Eulerian graph

An Eulerian graph is a graph in which there exists a cycle that visits every edge exactly once.