Polyhedra without cubic vertices are prism‐hamiltonian
Simon Špacapan · Journal of Graph Theory · 2024
Abstract The prism over a graph is the Cartesian product of with the complete graph on two vertices. A graph is prism‐hamiltonian if the prism over is hamiltonian. We prove that every polyhedral graph (i.e., 3‐connected planar graph) of minimum degree at least four is prism‐hamiltonian.