K-CRITICAL, N-CONNECTED GRAPHS

被引：0

|

作者：

MAURER, S ^{[1
]}

SLATER, PJ ^{[1
]}

机构：

[1] SANDIA LABS,DIV APPL MATH,ALBUQUERQUE,NM 87115

来源：

DISCRETE MATHEMATICS | 1977年 / 20卷 / 03期

关键词：

D O I：

10.1016/0012-365X(77)90065-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：255 / 262

页数：8

相关论文

共 50 条

[31] Matching extension in the powers of n-connected graphs
Walcher, KL
JOURNAL OF GRAPH THEORY, 1996, 23 (04) : 355 - 360
[32] k-Critical graphs in P5-free graphs
Cameron, Kathie
Goedgebeur, Jan
Huang, Shenwei
Shi, Yongtang
THEORETICAL COMPUTER SCIENCE, 2021, 864 : 80 - 91
[33] On themaximum number of edges in k-critical graphs
Luo, Cong
Ma, Jie
Yang, Tianchi
COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (06) : 900 - 911
[34] On vertices of degree n in minimally n-connected graphs and digraphs
Mader, W
COMBINATORICS, PAUL ERDOS IS EIGHTY, VOL. 2, 1996, 2 : 423 - 449
[35] High connectivity keeping sets in n-connected graphs
Mader, W
COMBINATORICA, 2004, 24 (03) : 441 - 458
[36] MINIMALLY N-CONNECTED INFINITE GRAPHS AND EXTREMAL PROBLEM
MADER, W
ARCHIV DER MATHEMATIK, 1972, 23 (05) : 553 - 560
[37] High connectivity keeping sets in n-connected graphs
Mader W.
Combinatorica, 2004, 24 (3) : 441 - 458
[38] k-Critical Graphs in P5-Free Graphs
Cameron, Kathie
Goedgebeur, Jan
Huang, Shenwei
Shi, Yongtang
COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 411 - 422
[39] CORNERS OF NTH DEGREE IN MINIMAL N-CONNECTED GRAPHS
MADER, W
ARCHIV DER MATHEMATIK, 1972, 23 (02) : 219 - &
[40] FRAGMENTS IN 2-CRITICALLY N-CONNECTED GRAPHS
SU, JJ
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 58 (02) : 269 - 279

← 1 2 3 4 5 →