Highly edge-connected regular graphs without large factorizable subgraphs

被引：4

作者：

Mattiolo, Davide ^{[1
]}

Steffen, Eckhard ^{[2
,3
]}

机构：

[1] Univ Verona, Dipartimento Informat, Str Grazie 15, I-37134 Verona, Italy

[2] Paderborn Univ, Paderborn Ctr Adv Studies, Paderborn, Germany

[3] Paderborn Univ, Inst Math, Paderborn, Germany

来源：

JOURNAL OF GRAPH THEORY | 2022年 / 99卷 / 01期

关键词：

factorizations; perfect matchings; regular graphs;

D O I：

10.1002/jgt.22729

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We construct highly edge-connected r-regular graphs of even order which do not contain r - 2 pairwise disjoint perfect matchings. When r is a multiple of 4, the result solves a problem of Thomassen [4].

引用

页码：107 / 116

页数：10

共 50 条

[31] Degree sequence conditions for maximally edge-connected graphs and digraphs
Dankelmann, P
Volkmann, L
JOURNAL OF GRAPH THEORY, 1997, 26 (01) : 27 - 34
[32] SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Volkmann, Lutz
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 567 - 573
[33] Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
Bilinski, Mark
Jackson, Bill
Ma, Jie
Yu, Xingxing
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2011, 101 (04) : 214 - 236
[34] DENSE GRAPHS WITHOUT 3-REGULAR SUBGRAPHS
PYBER, L
RODL, V
SZEMEREDI, E
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) : 41 - 54
[35] The existence of strongly closed subgraphs in highly regular graphs
Wang, KS
ALGEBRA COLLOQUIUM, 2001, 8 (03) : 257 - 266
[36] 4-REGULAR GRAPHS WITHOUT 3-REGULAR SUBGRAPHS
ZHANG, LM
ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 691 - 699
[37] Highly connected subgraphs of graphs with given independence number
Fujita, Shinya
Liu, Henry
Sarkar, Amites
EUROPEAN JOURNAL OF COMBINATORICS, 2018, 70 : 212 - 231
[38] Non-separating subgraphs in highly connected graphs
Fujita, Shinya
Kawarabayashi, Ken-ichi
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 117 : 1 - 21
[39] A note on graphs without k-connected subgraphs
Yuster, R
ARS COMBINATORIA, 2003, 67 : 231 - 235
[40] Highly edge-connected factors using given lists on degrees
Akbari, Saieed
Hasanvand, Morteza
Ozeki, Kenta
JOURNAL OF GRAPH THEORY, 2019, 90 (02) : 150 - 159

← 1 2 3 4 5 →