Linked from

The 17 pages that link to Tree (graph theory), each with the reason it gives.

• Bipartite graphRelated: Every tree is bipartite because its vertices can be colored by distance parity from a root.

• Graph (discrete mathematics)Broader topic: Trees are the simplest connected structures, with a unique path between each vertex pair.

• Depth-first searchRelated: A DFS traversal tree records how the algorithm first reaches each vertex.

• Free groupRelated: Free groups act naturally on trees, and their standard Cayley graphs are trees.

• TreewidthNarrower topic: A tree decomposition organizes overlapping vertex bags in a tree structure.

• Path graphRelated: Every path graph is a tree with maximum degree at most two.

• Spanning treeNarrower topic: A spanning tree must itself be a tree.

• Undirected graphBroader topic: Trees are undirected graphs whose unique paths make them useful structural models.

• Euler's polyhedron formulaRelated: A tree has one fewer edge than vertices, the key count in a graph-based proof.

• Handshaking lemmaBroader topic: A tree with n vertices has n−1 edges, so its degrees sum to 2n−2.

• Cayley's formulaNarrower topic: Cayley's formula counts trees, with each vertex carrying a distinct label.

• Kirchhoff's theoremNarrower topic: A spanning tree is a tree that includes every vertex of the original graph.

• Kőnig's lemmaNarrower topic: Kőnig's lemma concerns rooted trees as a special case of this graph structure.

• Hosoya indexBroader topic: Removing a leaf yields a compact recurrence for the total matching count.

• MazeCompared with: A tree-shaped maze has a unique route between any two points, unlike one with loops.

• Bunkbed conjectureBroader topic: Bunkbed inequalities can be analyzed particularly directly when the base graph is a tree.

• Burr–Erdős conjectureBroader topic: Trees are 1-degenerate, providing a basic family covered by the conjecture.