Guichard-Combinatorics-Graph-Theory · Problem 5.5.1

Graph Theory

Mathematics — Probability · trees

Problem

Suppose that

G

is a connected graph, and that every spanning tree contains edge

e

. Show that

e

is a bridge.