◀ ▲ ▶Branches / Graph-theory / Theorem: Characterization of Semi-Eulerian Graphs
Theorem: Characterization of Semi-Eulerian Graphs
A simple graph G(V,E) is semi-Eulerian, if and only if it is connected and it has exactly two vertices with an odd degree.
This theorem is due to the Swiss mathematician Leonhard Euler (1707 - 1783).
Table of Contents
Proofs: 1
Mentioned in:
Parts: 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