论文信息 - Fragments in 2-Critically n-Connected Graphs

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.

Jian Ji Su

[1] Wolfgang Mader. Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen , 1985, Eur. J. Comb..

[2] Peter J. Slater,et al. A note on $k$-critically $n$-connected graphs , 1977 .