- Leaf: a vertex of degree 1.
- Tree-graphic: a sequence is said to be tree-graphic if it is a permutation of the degree sequence of a tree.
Every tree with at least 1 edge hase at least 2 leaves.
If the degree of every vertex of a graph is at least 2, then that graph must contain a cycle.