Polyhedra without cubic vertices are prism‐hamiltonianŠpacapan, Simon (Avtor) circuit graphHamiltonian cycleThe prism over a graph G is the Cartesian product of Gwith the complete graph on two vertices. A graph G isprism‐hamiltonian if the prism over G is hamiltonian.We prove that every polyhedral graph (i.e., 3‐connectedplanar graph) of minimum degree at least four isprism‐hamiltonian.Wiley20242024-05-30 03:30:16Članek v reviji88852sl© 2024 The Authors