Triangulated map with minimum degree four is Hamiltonian
  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. 
Dipendu Maity and Ashish Kumar Upadhyay
math.CO math.GT