English

Triangulated map with minimum degree four is Hamiltonian

Combinatorics 2014-07-14 v2 Geometric Topology

Abstract

A triangulationtriangulation 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.

Keywords

Cite

@article{arxiv.1406.5615,
  title  = {Triangulated map with minimum degree four is Hamiltonian},
  author = {Dipendu Maity and Ashish Kumar Upadhyay},
  journal= {arXiv preprint arXiv:1406.5615},
  year   = {2014}
}

Comments

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

R2 v1 2026-06-22T04:43:59.094Z