Linked from

The 9 pages that link to Spanning tree, each with the reason it gives.

• Graph theoryBroader topic: It preserves connectivity while removing every unnecessary cycle.

• Incidence matrixBroader topic: Deleting one row of a connected graph's oriented incidence matrix yields a square submatrix for each spanning tree.

• Tree (graph theory)Broader topic: It preserves reachability while removing every cycle from the larger graph.

• Connected graphBroader topic: It preserves reachability using the fewest possible edges.

• Euler's polyhedron formulaRelated: Counting a spanning tree and the remaining edges gives a standard proof of the formula.

• Kruskal's algorithmNarrower topic: Kruskal's output must connect all vertices without forming cycles.

• Cayley's formulaRelated: Trees counted by Cayley's formula are spanning trees of the complete graph.

• Kirchhoff's theoremBroader topic: The objects counted by the theorem are spanning trees.

• BEST theoremNarrower topic: An in-arborescence is the directed, rooted form counted in the theorem.