Connectivity keeping paths in k-connected bipartite graphs

被引：7
|
作者：
Luo, Lian [1 ]
Tian, Yingzhi [1 ]
Wu, Liyun [1 ]
机构：
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
来源：
DISCRETE MATHEMATICS | 2022年 / 345卷 / 04期
关键词：
Connectivity; Bipartite graphs; Paths; TREES;
D O I：
10.1016/j.disc.2021.112788
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In 2010, Mader ((2010) [10]) proved that every k-connected graph G with minimum degree at least [ 3k/2 ] + m - 1 contains a path P of order m such that G - V(P) is still k-connected. In this paper, we consider similar problem for bipartite graphs, and prove that every k-connected bipartite graph G with minimum degree at least k + m contains a path P of order m such that G - V(P) is still k-connected. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数：5
相关论文
共 50 条
12345