Induced paths in 5-connected graphs
Matthias Kriesell · Journal of Graph Theory · 2001
We show that between any two vertices of a 5-connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2-connected. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 52–58, 2001