Topic: Characterizations of Trees

Worked Forest Edge Counts from Components

Verify a Tree from an Explicit Edge List

Unique Paths Characterize Trees

Trees as Connected Acyclic Graphs

The Edge Count Formula for Forests

Single-Vertex Trees and Empty-Graph Conventions

Recognizing Trees by Repeated Leaf Removal

Minimal Connected Graphs Versus Maximum Subgraphs

Minimal Connectivity Characterizes Trees

Leaf-Induction Proof Workshop