The connectivity of minimal imperfect graphs

被引：0

作者：

Sebo, A ^{[1
]}

机构：

[1] INST DISKRETE MATH, BONN, GERMANY

来源：

JOURNAL OF GRAPH THEORY | 1996年 / 23卷 / 01期

关键词：

D O I：

10.1002/(SICI)1097-0118(199609)23:1<77::AID-JGT9>3.0.CO;2-H

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that partitionable graphs are 2 omega - 2-connected, that this bound is sharp, and prove some structural properties of cutsets of cardinality 2 omega - 2. The proof of the connectivity result is a simple linear algebraic proof. (C) 1996 John Wiley & Sons, Inc.

引用

页码：77 / 85

页数：9

共 50 条

[1] On transversals in minimal imperfect graphs
Fouquet, JL
Maire, F
Rusu, I
Thuillier, H
[J]. DISCRETE MATHEMATICS, 1997, 165 : 301 - 312
[2] NO ANTITWINS IN MINIMAL IMPERFECT GRAPHS
OLARIU, S
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 45 (02) : 255 - 257
[3] Some properties of minimal imperfect graphs
Hoang, CT
[J]. DISCRETE MATHEMATICS, 1996, 160 (1-3) : 165 - 175
[4] On minimal imperfect graphs with circular symmetry
Basco, G
Boros, E
Gurvich, V
Maffray, F
Preissmann, M
[J]. JOURNAL OF GRAPH THEORY, 1998, 29 (04) : 209 - 225
[5] Minimal imperfect graphs: A simple approach
Gasparian, GS
[J]. COMBINATORICA, 1996, 16 (02) : 209 - 212
[6] On critical edges in minimal imperfect graphs
Sebo, A
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 67 (01) : 62 - 85
[7] On vertex neighborhood in minimal imperfect graphs
Barré, V
[J]. DISCRETE MATHEMATICS, 2001, 233 (1-3) : 211 - 218
[8] MAXIMAL MINIMAL CONNECTIVITY IN GRAPHS
PETERS, K
LASKAR, R
HEDETNIEMI, S
[J]. ARS COMBINATORIA, 1986, 21 : 59 - 70
[9] A NEW CONJECTURE ABOUT MINIMAL IMPERFECT GRAPHS
MEYNIEL, H
OLARIU, S
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1989, 47 (02) : 244 - 247
[10] New Results on Minimal Strongly Imperfect Graphs
Anastasoaei, Vasile
Olaru, Elefterie
[J]. SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2008, 18 : 1 - 12

← 1 2 3 4 5 →