◀ ▲ ▶Branches / Graphtheory / Corollary: Even Number of Vertices with an Odd Degree in Finite Graphs
Corollary: Even Number of Vertices with an Odd Degree in Finite Graphs
(related to Lemma: Handshaking Lemma for Finite Graphs)
Let \(G=(V,E,\gamma)\) be a finite graph. Then the number of vertices with an odd vertex degrees is even.
Table of Contents
Proofs: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Krumke S. O., Noltemeier H.: "Graphentheoretische Konzepte und Algorithmen", Teubner, 2005, 1st Edition