\begin{definition}[Definition:Semi-Eulerian Graph]
A graph is called '''semi-Eulerian''' {{iff}} 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.
\end{definition}