Abstract

We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vertices. That all 3-connected cubic planar graphs on at most 176 vertices and with face size at most 6 are hamiltonian is also verified. 1 Introduction. In this paper we describe an investigation (making much use of computation) of cyclically k-connected cubic planar graphs (CkCPs) for k = 4, 5 and report the results. We shall also have occasion to consider cubic 3-connected planar graphs with no restriction on cyclic connectivity; these we refer to as C3CPs. The investigation

Citations