Abstract
AbstractThe 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
