Definition:Eulerian Graph
From ProofWiki
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:
Source of Name
This entry was named for Leonhard Paul Euler.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 3.1$
