UNAVOIDABLE IMMERSIONS OF 4− AND f(t)−EDGE-CONNECTED GRAPHS

被引：0
|
作者：
Ding, Guoli [1 ]
Qualls, Brittian [1 ]
机构：
[1] Mathematics Department, Louisiana State University, Baton Rouge,LA, United States
来源：
arXiv |
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Undirected graphs
引用
收藏
相关论文
共 50 条
  • [21] Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs
    Shuang Zhao
    Yingzhi Tian
    Jixiang Meng
    Graphs and Combinatorics, 2020, 36 : 1065 - 1078
  • [22] The Erdos-Posa property for edge-disjoint immersions in 4-edge-connected graphs
    Kakimura, Naonori
    Kawarabayashi, Ken-ichi
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 131 : 138 - 169
  • [23] Decomposing highly edge-connected graphs into paths of any given length
    Botler, F.
    Mota, G. O.
    Oshiro, M. T. I.
    Wakabayashi, Y.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 508 - 542
  • [24] Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
    Merker, Martin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 91 - 108
  • [25] Highly edge-connected regular graphs without large factorizable subgraphs
    Mattiolo, Davide
    Steffen, Eckhard
    JOURNAL OF GRAPH THEORY, 2022, 99 (01) : 107 - 116
  • [26] Maximally edge-connected hypergraphs
    Dankelmann, Peter
    Meierling, Dirk
    DISCRETE MATHEMATICS, 2016, 339 (01) : 33 - 38
  • [27] Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
    Volkmann, Lutz
    ARS COMBINATORIA, 2010, 96 : 105 - 114
  • [28] The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
    Yang, Weihua
    Tian, Yingzhi
    Li, Hengzhe
    Li, Hao
    Guo, Xiaofeng
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 304 - 309
  • [29] Unavoidable Parallel Minors of 4-Connected Graphs
    Chun, Carolyn
    Ding, Guoli
    Oporowski, Bogdan
    Vertigan, Dirk
    JOURNAL OF GRAPH THEORY, 2009, 60 (04) : 313 - 326
  • [30] Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
    Meierling, Dirk
    Volkmann, Lutz
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1775 - 1781
12345