Eulerian and Hamiltonian Graphs · Superchallenge problem

The wheel graph $W_7$ has a hub joined to all $7$ rim vertices of a $7$-cycle $1,\ldots,7$. What is the minimum number of vertices that must be deleted from this $8$-vertex graph so that NO Hamiltonian cycle survives?