In graph theory [Graph theory], a biconnected graph [Graph] is a connected [Connected graph] and “nonseparable” graph, meaning that if any one vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices.

The property of being 2-connected [k-vertex-connected graph] is equivalent to biconnectivity, except that the complete graph of two vertices is usually not regarded as 2-connected.

## Bibliography

“Biconnected Graph.” 2022.

*Wikipedia*, November. https://en.wikipedia.org/w/index.php?title=Biconnected_graph&oldid=1123654962.