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 条
  • [11] Minimally (k, k)-edge-connected graphs
    Hennayake, K
    Lai, HJ
    Li, DY
    Ma, JZ
    JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 116 - 131
  • [12] On graphs without crowns with regular μ-subgraphs
    Kabanov, VV
    MATHEMATICAL NOTES, 2000, 67 (5-6) : 736 - 742
  • [13] On graphs without crowns with regularμ-subgraphs
    V. V. Kabanov
    Mathematical Notes, 2000, 67 : 736 - 742
  • [14] On the existence of super edge-connected graphs with prescribed degrees
    Tian, Yingzhi
    Meng, Jixiang
    Lai, Hongjian
    Zhang, Zhao
    DISCRETE MATHEMATICS, 2014, 328 : 36 - 41
  • [15] Sufficient conditions for graphs to be λ′-optimal super-edge-connected and maximally edge-connected
    Hellwig, A
    Volkmann, L
    JOURNAL OF GRAPH THEORY, 2005, 48 (03) : 228 - 246
  • [16] Packing spanning trees and spanning 2-connected k-edge-connected essentially -edge-connected subgraphs
    Gu, Xiaofeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 924 - 933
  • [17] CRITICAL N-FOLD EDGE-CONNECTED GRAPHS
    MADER, W
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 40 (02) : 152 - 158
  • [18] Maximally edge-connected and vertex-connected graphs and digraphs: A survey
    Hellwig, Angelika
    Volkmann, Lutz
    DISCRETE MATHEMATICS, 2008, 308 (15) : 3265 - 3296
  • [19] Neighborhood conditions for graphs and digraphs to be maximally edge-connected
    Hellwig, Angelika
    Volkmann, Lutz
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 265 - 277
  • [20] Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs
    Katic, Robert
    Magnant, Colton
    Nowbandegani, Pouria Salehi
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 969 - 979
12345