On k-critical 2k-connected graphs

被引：0

作者：

Su, JJ ^{[1
]}

Yuan, XD ^{[1
]}

Zhao, QF ^{[1
]}

机构：

[1] Guangxi Normal Univ, Dept Math, Guilin 541004, Peoples R China

来源：

SCIENCE IN CHINA SERIES A-MATHEMATICS | 2003年 / 46卷 / 03期

关键词：

k-critical n-connected; fragment; second-end;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A graph G is called an (n, k)-graph if kappa(G - S) = n - \S\ for any S subset of or equal to V(G) with \S\ less than or equal to k., where kappa(G) denotes the connectivity of G. Mader conjectured that for k greater than or equal to 3 the graph K2k+2-(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3, 4. We prove the conjecture for the general case k greater than or equal to 5.

引用

页码：289 / 299

页数：11

共 50 条

[1] On k-critical 2k-connected graphs
苏健基
袁旭东
赵巧凤
ScienceinChina,SerA., 2003, Ser.A.2003 (03) : 289 - 299
[2] On k-critical 2k-connected graphs
苏健基
袁旭东
赵巧凤
Science China Mathematics, 2003, (03) : 289 - 299
[3] The k-critical 2k-connected graphs for k ∈ {3,4}
Kriesell, M
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 78 (01) : 69 - 80
[4] On k-critical connected line graphs
Kriesell, M
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (01) : 1 - 7
[5] K-CRITICAL, N-CONNECTED GRAPHS
MAURER, S
SLATER, PJ
DISCRETE MATHEMATICS, 1977, 20 (03) : 255 - 262
[6] FRAGMENTS IN K-CRITICAL N-CONNECTED GRAPHS
SU, JJ
JOURNAL OF GRAPH THEORY, 1995, 20 (03) : 287 - 295
[7] NUMBER OF 1-FACTORS IN 2K-CONNECTED GRAPHS
BOLLOBAS, B
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 25 (03) : 363 - 366
[8] PROOF OF SLATERS CONJECTURE ON K-CRITICAL N-CONNECTED GRAPHS
SU, JJ
KEXUE TONGBAO, 1988, 33 (20): : 1675 - 1678
[9] PACKING k-MATCHINGS AND k-CRITICAL GRAPHS
Hartvigsen, David
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (01) : 320 - 351
[10] COUNTING CRITICAL SUBGRAPHS IN k-CRITICAL GRAPHS
Ma, Jie
Yang, Tianchi
COMBINATORICA, 2021, 41 (05) : 669 - 694

← 1 2 3 4 5 →