block
A subgraph of a graph is a block of if either it is a bridge (together with the vertices incident
with the bridge) or else it is a maximal 2-connected subgraph of .
Any two blocks of a graph have at most one vertex in common. Also, every vertex belonging to at least two blocks is a cutvertex of , and, conversely, every cutvertex belongs to at least two blocks.
Adapted with permission of the author from by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.