A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.
Bi-Connected Component
See also
Strongly Connected ComponentExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Bi-Connected Component." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Bi-ConnectedComponent.html