◀ ▲ ▶Branches / Graph-theory / Theorem: Characterization of Eulerian Graphs
Theorem: Characterization of Eulerian Graphs
A simple graph \(G(V,E)\) is Eulerian, if and only if it is connected and every vertex has an even degree.
This theorem is due to the Swiss mathematicianLeonhard Euler (1707 - 1783).
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1
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