Fragments in 2-Critically n-Connected Graphs

Mader conjectured that every non-complete k-critically n-connected graph has (2k + 2) pairwise disjoint fragments. The conjecture was verified by Mader for k = 1. In this paper, we prove that this conjecture holds also for k = 2.