A degree sum condition for the existence of a quasi 5-contractible edge in a quasi 5-connected graph

An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. We show that every 5-connected graph contains a quasi 5-contractible edge. Furthermore, we prove that a quasi 5-connected graph possesses a quasi 5-contractible edge, if the degree sum of any two vertices with distance at most two is at least 9. This result strengthens a theorem proved by Kriesell when $k=4$ (M. Kriesell, A degree sum condition for the existence of a contractible edge in a $k$-connected graph, J. Combin. Theory Ser. B 82(2001)81-101).