A graph is said to be biconnected if two paths that do not share edges or vertices exist between every pair of vertices. a. Which graphs in Figures 29-1 and 29-4 are biconnected? b. What are some...

A graph is said to be biconnected if two paths that do not share edges or vertices exist between every pair of vertices.

a. Which graphs in Figures 29-1 and 29-4 are biconnected?

b. What are some applications that would use a biconnected graph?