Definition: Trees and Forests
Let \(G(V,E,\gamma)\) be an undirected graph.
- \(G\) is called a forest, if it contains only acyclic components.
- \(G\) is called a tree, if it has only one acyclic component.
| | | | | Contributors: bookofproofs | References: 
1.Proposition: Equivalent Definitions of Trees
2.Lemma: Lower Bound of Leaves in a Tree
3.Definition: Spanning Tree
4.Definition: Graph Decomposable Into \(k\) Trees
This work is a derivative of:
Bibliography (further reading)
 Krumke Sven O., Noltemeier Hartmut: “Graphentheoretische Konzepte und Algorithmen”, Teubner, 2005, Auflage 1