Triangulated map with minimum degree four is Hamiltonian

2014/06/21 by Dipendu Maity, Maity, Dipendu, Ashish Kumar Upadhyay +1
Mathematics · #05C38 #57M20 #57N05 #Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT) #math.CO #math.GT #msc:05C38 #msc:57M20 #msc:57N05

paper · pdf · doi:10.48550/arxiv.1406.5615

This paper has been withdrawn by the author due to a crucial error in the result

arxiv created 2014/07/11 · arxiv updated 2014/07/14

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.

Related

• Contractible Hamiltonian Cycles in Triangulated Surfaces
• Number of Hamiltonian cycles in planar triangulations
• Counting Hamiltonian cycles in planar triangulations
• Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
• Hamiltonian Cycles in Polyhedral Maps