Triangulated map with minimum degree four is Hamiltonian
classification
🧮 math.CO
math.GT
keywords
degreefourhamiltonianminimumtriangulatedarticlecontractiblecycle
read the original abstract
A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.