Graph Theory: 35. Bridges in Connected Graphs

Here I provide a proof of the fact that removing a bridge edge in a connected graph results in a graph with exactly 2 connected components.
An introduction to Graph Theory by Dr. Sarada Herke.

Related Videos:

For quick videos about Math tips and useful facts, check out my other channel