Eulerian and Hamiltonian Graphs · Superchallenge problem

Eight vertices $0,\ldots,7$ sit around a circle; each is joined to the vertices $1$ and $2$ steps away in either direction (so every vertex has degree $4$). What is the minimum number of vertices that must be deleted from this $8$-vertex graph so that NO Hamiltonian cycle survives?