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 条
  • [1] Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
    Zhao, Shuang
    Chen, Zongqing
    Yang, Weihua
    Meng, Jixiang
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 115 : 64 - 72
  • [2] Equitable factorizations of edge-connected graphs
    Hasanvand, Morteza
    DISCRETE APPLIED MATHEMATICS, 2022, 317 : 136 - 145
  • [3] Super-connected but not super edge-connected graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 22 - 25
  • [4] IMMERSIONS IN HIGHLY EDGE CONNECTED GRAPHS
    Marx, Daniel
    Wollan, Paul
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 503 - 520
  • [5] Vulnerability of super extra edge-connected graphs
    Cheng, Chia-Wen
    Hsieh, Sun-Yuan
    Klasing, Ralf
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 108 : 1 - 9
  • [6] Packing and covering immersions in 4-edge-connected graphs
    Liu, Chun-Hung
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 151 : 148 - 222
  • [7] Minimally (k, k)-edge-connected graphs
    Hennayake, K
    Lai, HJ
    Li, DY
    Ma, JZ
    JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 116 - 131
  • [8] Highly edge-connected detachments of graphs and digraphs
    Berg, AR
    Jackson, B
    Jordán, T
    JOURNAL OF GRAPH THEORY, 2003, 43 (01) : 67 - 77
  • [9] Super-cyclically edge-connected regular graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 393 - 411
  • [10] 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
12345