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 条
12345