Cycles in cubic graphs
Sheng Bau · Bulletin of the Australian Mathematical Society · 1992
nonhamiltonian cyclically 4-connected cubic planar graphs of the smallest order have 42 vertices.We were able to show that every 3-connected cubic planar graph has a cycle containing any given set of 21 vertices.