Left examples are called "Eulerian graphs."
A connected graph is Eulerian if and only if each vertex is incident to an even number of edges.
There exists a closed trail that hits each edge exactly once vs. not so.
There exists a closed path that hits each edge exactly once vs. not so.
Aaron David Fairbanks