Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs
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.
 Publication:

arXiv eprints
 Pub Date:
 September 2017
 arXiv:
 arXiv:1709.01367
 Bibcode:
 2017arXiv170901367W
 Keywords:

 Computer Science  Discrete Mathematics
 EPrint:
 6 pages, 2 figures, presented 2014 at a student workshop at the University of Bonn