Graph Theory37 sections · 1633 units
Open in Course

Vocabulary - Biconnected Component

Maximal subgraph without ar...

A biconnected component is a maximal subgraph with no articulation points. Any two vertices in the component remain connected even if you remove any other single vertex. Biconnected components are vertex-disjoint except at articulation points, which belong to multiple components.

The entire graph can be partitioned into biconnected components connected by articulation points. This structure helps analyze graph resilience.