Topic: Spanning Trees and Counting

Worked Spanning-Tree Counts For Explicit Graphs

Why Prüfer Encoding Is A Bijection

Using Graph Symmetry To Count Spanning Trees

The Weighted Matrix-Tree Theorem

The Matrix-Tree Theorem

The Deletion-Contraction Recurrence For Spanning Trees

Symmetry And Cofactor Methods On Small Graphs

Spanning Trees As Connected Spanning Subgraphs

Spanning-Tree Counts In Cycles And Complete Bipartite Examples

Reading Degrees From Prüfer Sequences