Connectivity keeping caterpillars and spiders in 2-connected graphs

被引：11
|
作者：
Hong, Yanmei [1 ]
Liu, Qinghai [2 ]
Lu, Changhong [3 ]
Ye, Qingjie [3 ]
机构：
[1] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350108, Peoples R China
[2] Fuzhou Univ, Ctr Discrete Math, Fuzhou 350002, Fujian, Peoples R China
[3] East China Normal Univ, Shanghai Key Lab PMMP, Sch Math Sci, Shanghai 200241, Peoples R China
来源：
DISCRETE MATHEMATICS | 2021年 / 344卷 / 03期
关键词：
Caterpillars; Spider; 2-connected graphs; Connectivity; Trees; TREES;
D O I：
10.1016/j.disc.2020.112236
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Mader (2010) conjectured that for any tree T of order m, every k-connected graph G with minimum degree at least [3k/2]+ m-1 contains a subtree T' congruent to T such that G-V(T') is k-connected. A caterpillar is a tree in which a single path is incident to every edge. The conjecture has been proved when k = 1 and for some special caterpillars when k = 2. A spider is a tree with at most one vertex with degree more than 2. In this paper, we confirm the conjecture for all caterpillars and spiders when k = 2. Spider (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数：4
相关论文
共 50 条
  • [1] Connectivity keeping trees in 2-connected graphs
    Hasunuma, Toru
    Ono, Kosuke
    JOURNAL OF GRAPH THEORY, 2020, 94 (01) : 20 - 29
  • [2] Connectivity keeping trees in 2-connected graphs
    Lu, Changhong
    Zhang, Ping
    DISCRETE MATHEMATICS, 2020, 343 (02)
  • [3] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Toru Hasunuma
    Algorithmica, 2021, 83 : 2697 - 2718
  • [4] Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
    Yang, Qing
    Tian, Yingzhi
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [5] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Hasunuma, Toru
    ALGORITHMICA, 2021, 83 (09) : 2697 - 2718
  • [6] Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    Hasunuma, Toru
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 316 - 329
  • [7] Connectivity keeping stars or double-stars in 2-connected graphs
    Tian, Yingzhi
    Meng, Jixiang
    Lai, Hong-Jian
    Xu, Liqiong
    DISCRETE MATHEMATICS, 2018, 341 (04) : 1120 - 1124
  • [8] On minimally 2-connected graphs with generalized connectivity
    Li, Shasha
    Li, Wei
    Shi, Yongtang
    Sun, Haina
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 141 - 164
  • [9] 2-connected graphs with the minimum algebraic connectivity
    Yu, Guanglong
    Sun, Lin
    Zhang, Hailiang
    Wu, Yarong
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21): : 6108 - 6113
  • [10] Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
    Casablanca, Rocio M.
    Mol, Lucas
    Oellermann, Ortrud R.
    DISCRETE APPLIED MATHEMATICS, 2021, 289 : 233 - 247
12345