A biconnected graph is a connected graph that remains connected when
any one of its vertices, and all the edges incident on this vertex,
is removed and the graph remains connected.
A biconnected component of a graph is a subgraph which is biconnected. An
integer label is assigned to each edge to indicate which biconnected component
it's in.
A vertex in a graph is called an articulation point if removing it increases
the number of connected components.
See the documentation for the Boost Graph Library for more details.