Definition:Eulerian Graph

Definition
A loop-multigraph or loop-multidigraph is called Eulerian if it contains an Eulerian circuit.

Such a graph is also called unicursal.

A unicursal graph is also, by definition, traversable.