Biconnected component

A **biconnected component** (also known as a biconnected subgraph) is a concept from graph theory that refers to a maximal subgraph in which any two vertices are connected to each other by two disjoint paths. In simpler terms, a biconnected component is a section of a graph where the removal of any single vertex (and the edges incident to it) will not disconnect the component.