Contractile Triples in 3-Connected Graphs

We prove that every 3-connected graph G of order at least nine has two adjacent edges xy and yz such that the graph obtained from G by contracting x, y, and z into a single vertex is also 3-connected.