Bi-Connected Component

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

See also

Strongly Connected Component

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Bi-Connected Component." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Bi-ConnectedComponent.html

Subject classifications