Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs

2017/09/05 by Pascal Welke, Welke, Pascal
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Advanced Database Systems and Queries #Graph Theory and Algorithms

paper · pdf · doi:10.48550/arxiv.1709.01367

Abstract

We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus graphs. We apply this algorithm to several molecular databases to report the numbers of graphs that are traceable cactus graphs.

Related

• 2-Trees: Structural Insights and the study of Hamiltonian Paths
• Hamiltonian Paths in C-shaped Grid Graphs
• Hamiltonian Cycle Problem is in P
• Hamiltonian Paths in Two Classes of Grid Graphs
• NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs