2.5-Connectivity: Unique Components, Critical Graphs, and Applications

Irene Heinrich, Till Heller, Eva Schmidt +1

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a…