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 条
12345