Biconnected graph

A biconnected graph is a graph that is connected and has no articulation points.

Contents

IntroductionAlgorithm to check if graph is biconnected.Applications of biconnected graph.

Connected
A graph is said to be connected if there is a path between every pair of vertices of the graph.

The following graph is connected since one vertex can be visited from any other vertex and at least one path exists between every pair of vertices.

The following graph is disconnected as it has two independent...