Cycles through 4 vertices in 3-connected graphs

S.C. Locke proposed a question: If G is a 3-connected graph with minimum degree d and X is a set of 4 vertices on a cycle in G , must G have a cycle through X with length at least min { 2 d , | V ( G ) | } ? In this paper, we answer this question.