• Corpus ID: 32143371

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

  title={Simple Necessary Conditions for the Existence of a Hamiltonian Path with Applications to Cactus Graphs},
  author={Pascal Welke},
  • Pascal Welke
  • Published 5 September 2017
  • Computer Science, Mathematics
  • ArXiv
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. 
ML2R Theory Nuggets Computational Complexity of Max-Sum Diversification
We show how max-sum diversification can be used to solve the kclique problem, a well-knownNP-complete problem. This reduction proves that max-sum diversification is NP-hard and provides a simple and
Hamiltonian Cycle Problem is in P
This paper presents the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding aHamiltonian cycle in general graphs and can deal with the finite general graphs including undirected, directed, and mixed.


Edmonds polytopes and weakly hamiltonian graphs
  • V. Chvátal
  • Mathematics, Computer Science
    Math. Program.
  • 1973
A direct application of the linear programming duality theorem leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the ones previously known.
Depth-First Search and Linear Graph Algorithms
  • R. Tarjan
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1972
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components
Determinant Sums for Undirected Hamiltonicity
A Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph running in O(1.657^{n}) time is presented, the first superpolynomial improvement on the worst case runtime for the problem since the O*(2^n) bound was established over 50 years ago.
A dynamic programming approach to sequencing problems
  • M. Held, R. Karp
  • Computer Science, Mathematics
    ACM National Meeting
  • 1961
A dynamic programming approach to the solution of three sequencing problems: a scheduling problem involving arbitrary cost functions, the traveling-salesman problem, and an assembly line balancing problem that admits of numerical solution through the use of a simple recursion scheme.
Zinc is not commercial, accessed: 2014-8-20
  • 2014
Graph Theory, volume 173
  • 2012
Note on Hamilton circuits and Hamilton paths