Triangulated map with minimum degree four is Hamiltonian

Dipendu Maity, Ashish Kumar Upadhyay

Published 2014-06-21, updated 2014-07-11Version 2

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.