From Halin's Edge Removability to Matching Removability in $k$-Connected Graphs

Hengzhe Li, Mingming Zhou, Shinya Fujita +1

We study matching-removability under the degree/connectivity regime of Halin's theorem, which asserts that every $k$-connected graph $G$ with minimum degree $\hat{I}´(G)\ge k+1$ contains…