$K_2$-Hamiltonian Graphs: II

In this paper we use theoretical and computational tools to continue our investigation of $K2$-hamiltonian graphs, i.e. graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, and their interplay with $K1$-hamiltonian graphs, i.e. graphs in which every vertex-deleted subgraph is hamiltonian. Perhaps surprisingly, there exist graphs that are both $K1$- and $K2$-hamiltonian, yet non-hamiltonian, e.g. the Petersen graph. Gr\"unbaum conjectured that every planar $K1$-hamiltonian graph must itself be hamiltonian; Thomassen disproved this conjecture. Here we show that even planar graphs that are both $K1$- and $K2$-hamiltonian need not be hamiltonian, and that the number of such graphs grows at least exponentially. Motivated by results of Aldred, McKay, and Wormald, we determine for every integer $n$ that is not 14 or 17 whether there exists a $K2$-hypohamiltonian, i.e. non-hamiltonian and $K2$-hamiltonian, graph of order~$n$, and characterise all orders for which such cubic graphs and such snarks exist. We also describe the smallest cubic planar graph which is $K2$-hypohamiltonian, as well as the smallest planar $K_2$-hypohamiltonian graph of girth $5$. We conclude with open problems and by correcting two inaccuracies from the first article [Zamfirescu, SIAM J. Disc. Math. 35 (2021) 1706-1728].