Chords in longest cycles

If a graph G is 3-connected and has minimum degree at least 4, then some longest cycle in G has a chord. If G is 2-connected and cubic, then every longest cycle in G has a chord.