Definition: Spanning Tree
A spanning subgraph, which is a tree, is called a spanning tree.
Table of Contents
- Theorem: Number of Labeled Spanning Trees
Mentioned in:
Theorems: 1
Thank you to the contributors under CC BY-SA 4.0!

- Github:
-

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