WITHDRAWN: Connectivity keeping trees in 3-connected bipartite graphs with girth conditions

arXiv2304.11596MaRDI QIDQ6509780FDOQ6509780

Authors: Qing Yang, Yingzhi Tian 

Abstract: Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $delta(G)geqk+t$, where $t=max|X|,|Y|$, contains a subtree $T^{\prime }congT$ such that $G-V(T^{\prime })$ remains $k$-connected. This conjecture has been proved for caterpillars and spiders when $kleq3$; and for paths with odd order. In this paper, we prove that this conjecture holds if $G$ is a bipartite graph with $g(G)geqdiam(T)-1$ and $kleq3$, where $g(G)$ and $diam(T)$ denote the girth of $G$ and the diameter of $T$, respectively.

This page was built for publication: WITHDRAWN: Connectivity keeping trees in 3-connected bipartite graphs with girth conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509780)