Drawing of the day: A biconnected graph can be decomposed into a "block-cut tree", which has one node per biconnected component, and where overlapping biconnected components are connected via articulation points.