Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Simon Špacapan (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: