2020/11/08 by Luo, Lian, Tian, Yingzhi, Wu, Liyun
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2011.03929
In 2010, Mader [W. Mader, Connectivity keeping paths in k-connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every k-connected graph G with minimum degree at least \lfloor(3k)/(2)\rfloor+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.