Eulerian graph
A graph that has a closed walk using every edge exactly once.
A connected graph is Eulerian if it has an Euler circuit -- a closed walk traversing every edge exactly once.
See also
Point table
Graph settings
Calculator