A strengthening of the Kuratowski planarity criterion for 3-connected graphs

Abstract We prove that any non-planar 3-connected graph with at least 6 vertices contains a cycle with three pairwise ‘interwoven’ chords.