Definition:Semi-Eulerian Graph
From ProofWiki
Definition
A graph is called semi-Eulerian if it contains an Eulerian path.
Such a graph is also called traversable.
Note that the definition of graph here includes:
Note that an Eulerian graph is also semi-Eulerian, as an Eulerian circuit is still a path, and therefore an Eulerian path.
Source of Name
This entry was named for Leonhard Paul Euler.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 3.1$
