Connectivity keeping paths in k-connected bipartite graphs
Connectivity keeping paths in k-connected bipartite graphs
复制标题
在 k 连接二部图中保持路径的连通性
DOI：
10.1016/j.disc.2021.112788
复制
发表时间：
2022-04
影响因子：
0.8
通讯作者：
Liyun Wu
中科院分区：
文献类型：
--
作者：
Lian Luo;Yingzhi Tian;Liyun Wu
2010年，马德尔（（2010）[10]）证明了：每个最小度至少为+ m− 1的k-连通图G都包含一条m阶路P，使得G− V（P）仍然是k-连通的。本文考虑了二部图的类似问题，证明了每个最小度至少为k+ m的k-连通二部图G都含有一条m阶路P，使得G− V（P）仍然是k-连通的.
Abstract In 2010, Mader ((2010)[10]) proved that every k-connected graph G with minimum degree at least⌊ 3 k 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.