Polyhedra without cubic vertices are prism-hamiltonian
Combinatorics
2021-04-12 v1
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.
Keywords
Cite
@article{arxiv.2104.04266,
title = {Polyhedra without cubic vertices are prism-hamiltonian},
author = {Simon Špacapan},
journal= {arXiv preprint arXiv:2104.04266},
year = {2021}
}