Note on \(k\)-contractible edges in \(k\)-connected graphs (Q2760438)

In 1981, \textit{C. Thomassen} [J. Graph Theory 5, 351-354 (1981; Zbl 0498.05044)] proved that a \(k\)-connected triangle free graph contains an edge \(e\) such that the contraction of \(e\) results in a \(k\)-connected graph. For \(k\geq 3\) odd, the author presents the following generalization of Thomassen's result. A \(k\)-connected (\(k\) odd) \(K^-_4\)-free graph contains an edge \(e\) such that the contraction of \(e\) results in a \(k\)-connected graph, where \(K^-_4\) is obtained from the complete graph \(K_4\) by removing one edge. The graph \(K_3\times K_3\times\cdots\times K_3=K_3^{k/2}\) with \(k\) even, shows that this statement does not hold when \(k\) is even.