graph_biconnected (568B)
1 # Biconnected graph 2 3 A *biconnected graph* is an [undirected_graph] which is [connected] and has no [cut_vertex] 4 5 Equivalently, by [Menger's_theorem], in a biconnected graph featuring at least 3 vertices, between any two distinct vertices you must have two vertex-disjoint paths 6 7 Up: [graph_basic_notions] 8 9 Aliases: biconnected graph, biconnected graphs, 2-vertex connected graph, 2-vertex connected graphs, 2-vertex connected, 2 vertex connected, 2 vertex connected graph, 2 vertex connected graphs 10 11 See also: [biconnected_component], [block_cut_tree], [block_graph]