1.Previous
3.Next

Every 2-connected graph can be constructed inductively by adding paths to a cycle.

See also

*Biconnected component

References

* Eric W. Weisstein. "Biconnected Graph." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/BiconnectedGraph.html
* Paul E. Black, "biconnected graph", in Dictionary of Algorithms and Data Structures [online], Paul

1.Previous
3.Next