Definition:Eulerian Graph

Definition
A graph is called Eulerian if it contains an Eulerian circuit.

Such a graph is also called unicursal.

A unicursal graph is also, by definition, traversable.

Note that the definition of graph here includes:
 * Simple graph
 * Loop-graph
 * Multigraph
 * Loop-multigraph.