中国科学A辑(英文版)
中國科學A輯(英文版)
중국과학A집(영문판)
SCIENCE IN CHINA
2003年
3期
289-299
,共11页
k-critical n-connected%fragment%second-end
A graph G is called an (n,k)-graph if k(G- S) = n - |S| for any S C V(G) with |S| ≤ k,where k(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K2k+2-(1-factor) isthe unique (2k, k)-graph. Kriesell has settled two special cases for k = 3, 4. We prove the conjecture for thegeneral case k ≥ 5.
