We prove the result stated in the title (conjectured by Grunbaum) and
a conjecture of Plummer that every graph which can be obtained from a
4-connected planar graph by deleting two vertices is Hamiltonian. The
proofs are constructive and give rise to polynomial-time algorithms. (
C) 1994 Academic Press, Inc