Find the articulation points of this graph with one DFS. Each vertex gets a discovery time, its position in the order label, and a low-link, the badge: the earliest discovery time it can reach by walking down tree edges and then along a single back edge. A vertex u is an articulation point when some child cannot climb past u, low[child] >= disc[u].
Finding articulation points over 7 vertices.
Enter 0 at time 0: disc[0] = low[0] = 0. Until a back edge or a child says otherwise, the earliest vertex 0 can reach is itself.
Enter 0, discovery time 0.
Enter 1 at time 1: disc[1] = low[1] = 1. Until a back edge or a child says otherwise, the earliest vertex 1 can reach is itself.
Enter 1, discovery time 1.
Enter 2 at time 2: disc[2] = low[2] = 2. Until a back edge or a child says otherwise, the earliest vertex 2 can reach is itself.
Enter 2, discovery time 2.
Edge 2-0 leads to a vertex seen at time 0, an ancestor on the current path. That is earlier than low[2] = 2, so low[2] becomes 0: 2 can climb to 0.
Back edge 2 to 0, low of 2 is 0.
Enter 3 at time 3: disc[3] = low[3] = 3. Until a back edge or a child says otherwise, the earliest vertex 3 can reach is itself.
Enter 3, discovery time 3.
Enter 4 at time 4: disc[4] = low[4] = 4. Until a back edge or a child says otherwise, the earliest vertex 4 can reach is itself.
Enter 4, discovery time 4.
Enter 5 at time 5: disc[5] = low[5] = 5. Until a back edge or a child says otherwise, the earliest vertex 5 can reach is itself.
Enter 5, discovery time 5.
Edge 5-3 leads to a vertex seen at time 3, an ancestor on the current path. That is earlier than low[5] = 5, so low[5] becomes 3: 5 can climb to 3.
Back edge 5 to 3, low of 5 is 3.
Enter 6 at time 6: disc[6] = low[6] = 6. Until a back edge or a child says otherwise, the earliest vertex 6 can reach is itself.
Enter 6, discovery time 6.
dfs(6) returned with low[6] = 6. low[5] stays 3. low[6] = 6 >= disc[5] = 5: 6 cannot climb past 5, so 5 is an articulation point.
Back in 5, low 3.
dfs(5) returned with low[5] = 3. low[4] drops to 3. low[5] = 3 < disc[4] = 4: 5 climbs past 4 by a back edge, so 4 is not cut by this child.
Back in 4, low 3.
dfs(4) returned with low[4] = 3. low[3] stays 3. low[4] = 3 >= disc[3] = 3: 4 cannot climb past 3, so 3 is an articulation point.
Back in 3, low 3.
Edge 3-5 leads to a vertex seen at time 5, already finished. low[3] = 3 is already that early or earlier, so nothing changes.
Back edge 3 to 5, low of 3 is 3.
dfs(3) returned with low[3] = 3. low[2] stays 0. low[3] = 3 >= disc[2] = 2: 3 cannot climb past 2, so 2 is an articulation point.
Back in 2, low 0.
dfs(2) returned with low[2] = 0. low[1] drops to 0. low[2] = 0 < disc[1] = 1: 2 climbs past 1 by a back edge, so 1 is not cut by this child.
Back in 1, low 0.
dfs(1) returned with low[1] = 0. low[0] stays 0. 0 is the root. It only cuts if a second subtree starts here.
Back in 0, low 0.
Edge 0-2 leads to a vertex seen at time 2, already finished. low[0] = 0 is already that early or earlier, so nothing changes.
Back edge 0 to 2, low of 0 is 0.
Articulation points: 2, 3, 5. Removing any one of them disconnects the graph. One DFS, O(V + E).
3 articulation points.