Definition: Eulerian Graph
An Eulerian graph is a simple graph \(G(V,E)\) that contains an Eulerian tour.
Table of Contents
- Lemma: Splitting a Graph with Even Degree Vertices into Cycles
- Theorem: Characterization of Eulerian Graphs
Mentioned in:
Proofs: 1 2
Theorems: 3
Thank you to the contributors under CC BY-SA 4.0!

- Github:
-

References
Bibliography
- Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000