Topic: Cut Vertices, Bridges and Blocks

Why the Block-Cut Graph Is a Tree

Why Bridges Are Exactly Edges on No Cycle

Whitney’s Ear-Decomposition Characterization

The Block-Cut Incidence Graph

Reading Separations from a Block-Cut Tree

Open Ears and Ear Decompositions

How Cut Vertices and Bridges Interact

Finding an Ear in a 2-Connected Graph

Cut Vertices and Vertex Deletion

Computing Blocks from Edge Lists