Proof of Mader's conjecture on k-critical n-connected graphs
JianjiSu · Journal of Graph Theory · 2004
Mader conjectured that every k-critical n-connected noncomplete graph G has 2k+2 pairwise disjoint fragments. The author in [9] proved that the conjecture holds if the order of G is greater than (k...