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.

翻译：我们引入了两个无限族的3-正则平面图。这两个族都是Pohl-Warnsdorf算法寻找哈密顿路径的概念性对立结构。我们给出了哈密顿路径数量的闭式计算方法。