Polyhedra without cubic vertices are prism-hamiltonian

Autor:	Špacapan, Simon
Rok vydání:	2021
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph) of minimum degree at least four is prism-hamiltonian.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2104.04266 Zobrazit plný text záznamu View this record from Arxiv