Counting Hamiltonian Paths in 3-Regular Planar Graphs
arXiv:2606.07844
Abstract
We introduce two infinite families of 3-regular planar graphs. Both families are conceptual adversaries to the Pohl-Warnsdorf algorithm for finding Hamiltonians. We provide a closed form calculation of the number of Hamiltonians.