Triangulated map with minimum degree four is Hamiltonian
Dipendu Maity, Ashish Kumar Upadhyay

TL;DR
This paper proves that any triangulated map with a minimum degree of four contains a contractible Hamiltonian cycle, advancing understanding of Hamiltonian cycles in surface-embedded graphs.
Contribution
It establishes the existence of contractible Hamiltonian cycles in triangulated maps with minimum degree four, a new result in topological graph theory.
Findings
Existence of contractible Hamiltonian cycle in triangulated maps with minimum degree four
Extension of Hamiltonian cycle theory to surface-embedded graphs
New conditions for Hamiltonicity in triangulated maps
Abstract
A 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Advanced Combinatorial Mathematics
