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 条
  • [31] Degree sequence conditions for maximally edge-connected graphs depending on the clique number
    Dankelmann, P
    Volkmann, L
    DISCRETE MATHEMATICS, 2000, 211 (1-3) : 217 - 223
  • [32] Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
    Volkmann, Lutz
    ARS COMBINATORIA, 2011, 99 : 55 - 64
  • [33] Maximally edge-connected graphs and Zeroth-order general RandiA‡ index for
    Su, Guifu
    Xiong, Liming
    Su, Xiaofeng
    Li, Guojun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 182 - 195
  • [34] The constructive characterization of (κ,a"")-edge-connected digraphs
    Kovacs, Erika R.
    Vegh, Laszlo A.
    COMBINATORICA, 2011, 31 (02) : 201 - 223
  • [35] Super Edge-Connected Linear Hypergraphs
    Lin, Shangwei
    Pei, Jianfeng
    Li, Chunfang
    PARALLEL PROCESSING LETTERS, 2020, 30 (03)
  • [36] Vulnerability of super edge-connected networks
    Hong, Zhen-Mu
    Xu, Jun-Ming
    THEORETICAL COMPUTER SCIENCE, 2014, 520 : 75 - 86
  • [37] The constructive characterization of (κ,ℓ)-edge-connected digraphs
    Erika R. Kovács
    László A. Végh
    Combinatorica, 2011, 31 : 201 - 223
  • [38] Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5
    Jin Xin ZHOU
    Yan Tao LI
    Acta Mathematica Sinica,English Series, 2013, (08) : 1569 - 1580
  • [39] Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5
    Jin Xin ZHOU
    Yan Tao LI
    Acta Mathematica Sinica, 2013, 29 (08) : 1569 - 1580
  • [40] Unavoidable doubly connected large graphs
    Ding, GL
    Chen, P
    DISCRETE MATHEMATICS, 2004, 280 (1-3) : 1 - 12
12345