◀ ▲ ▶Branches / Graphtheory / Corollary: Even Number of Vertices with an Odd Degree in Finite Digraphs
Corollary: Even Number of Vertices with an Odd Degree in Finite Digraphs
(related to Lemma: Handshaking Lemma for Finite Digraphs)
Let \(D=(V,E,\alpha,\omega)\) be a finite digraph. Then the number of vertices with an odd degree 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