Definition: Leaf

A leaf of an undirected graph is a vertex \(v\) with degree \(d(v)=1\).

Definitions: 1 2
Lemmas: 3 4
Proofs: 5 6


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

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