Connectivity preserving spanning $(u,v)$-paths in $k$-connected graphs

Zhaolin Teng, Yingzhi Tian

Hasunuma [Graphs Combin. 41:10 (2025)] proved that for $k\ge 2$, there exists a function $f(k)=O(k)$ such that every $k$-connected graph $G$ of order $n\ge f(k)$ with $δ(G)\ge \fra…