The structure of saturated critical blocks

A 2‐connected graph G is a critical block if G ? v is not 2‐connected for every vertex v ∈ V(G). A critical block G is a saturated critical block if G + e is not a critical block for any new edge e. The structure of all saturated critical blocks and a procedure for constructing every saturated critical block are determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 223–237, 2003