Every simple 3-polytype with 34 vertices is Hamiltonian (Q1081618)

The smallest known counterexamples to Tait's conjecture that every planar 3-connected cubic graph has a Hamiltonian cycle were found independently by the present author and by Bosak and Lederberg. They have 38 vertices. \textit{H. Okamura} [J. Graph Theory 6, 185-196 (1982; Zbl 0493.05043)] gave a lower bound for the order of such a counterexample and in the present paper Okamura's method is modified in order to show that a counterexample must have at least 36 vertices.