block_cut_tree (333B)
1 # Block cut tree 2 3 The [bipartite] [tree] obtained from a [connected_graph] by creating one vertex for each [biconnected_component], one vertex for every [articulation_point], and one edge between each [articulation_point] and the [biconnected_components] to which it belongs 4 5 See also: [graph_biconnected] 6 7 Up: [graph_basic_notions]