Graph Theory: 55. Bridges and Blocks

In this video we look at two terms which are related to the idea of cut-vertices in a graph. Firstly, an edge is a bridge if its removal from a graph creates more connected components than were previously there. We have seen the topic of bridge edges in previous videos. Here we look at the connection between a bridge and a cut-vertex. Secondly, a nontrivial connected graph is called nonseparable (or 2-connected) if it has no cut-vertices, and a block is a maximal nonseparable subgraph of a graph. We look at example of the blocks of graphs and discuss the idea of an end-block.
-- Bits of Graph Theory by Dr. Sarada Herke.


Related videos:
GT 53: Cut-Vertices -    • Graph Theory: 53. Cut-Vertices  
GT 34: Bridge edges -    • Graph Theory: 34. Bridge edges  

For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" -    / spoonfulofmaths