The Complexity of Determining Existence a Hamiltonian Cycle is O(n³)

2007/06/19 by Guohun Zhu, Zhu, Guohun
Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.0706.2725

openalex publication_date 2007/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is O(n³).

Citations

• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

Related

• The Complexity of HCP in Digraps with Degree Bound Two
• NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
• Hamiltonian Cycle Problem is in P
• On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path
• On the Structure of Hamiltonian Graphs with Small Independence Number