biconnected graph


biconnected graph

[¦bī·kə′nek·təd ′graf] (mathematics) A connected graph in which two points must be removed to disconnect the graph.