Guichard-Combinatorics-Graph-Theory · Problem 5.5.3

Graph Theory

Mathematics — Probability · trees

Problem

Show that

G

is a tree if and only if it has no cycles and adding any new edge creates a graph with exactly one cycle.