Definition:Semi-Eulerian Graph

Definition
A graph is called semi-Eulerian if it contains an Eulerian trail.

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

Note that an Eulerian graph is also semi-Eulerian, as an Eulerian circuit is still a path, and therefore an Eulerian trail.

Also known as
A semi-Eulerian graph is also called a traversable graph.

Some sources have transversable graph but it is suspected that this is a mistake.

Also see

 * Definition:Eulerian Graph