Log In Sign Up

A new constraint of the Hamilton cycle algorithm

by   Heping Jiang, et al.

Grinberg's theorem is a necessary condition for the planar Hamilton graphs. In this paper, we use cycle bases and removable cycles to survey cycle structures of the Hamiltonian graphs and derive an equation of the interior faces in Grinberg's Theorem. The result shows that Grinberg's Theorem is suitable for the connected and simple graphs. Furthermore, by adding a new constraint of solutions to the equation, we find such solutions can be a necessary and sufficient condition for finding Hamiltonian graphs. We use the new constraint to improve the edge pruning technique and obtain a polynomial time algorithm for finding a Hamiltonian cycle in the connected and simple graphs.


page 1

page 2

page 3

page 4


A new proof of Grinberg Theorem based on cycle bases

Grinberg Theorem, a necessary condition only for planar Hamiltonian grap...

On non-Hamiltonian cycle sets of satisfying Grinberg's Equation

In [1] we used a cycle basis of the cycle space to represent a simple co...

Are highly connected 1-planar graphs Hamiltonian?

It is well-known that every planar 4-connected graph has a Hamiltonian c...

Hidden Hamiltonian Cycle Recovery via Linear Programming

We introduce the problem of hidden Hamiltonian cycle recovery, where the...

Algorithmic Extensions of Dirac's Theorem

In 1952, Dirac proved the following theorem about long cycles in graphs ...

Hamiltonicity in Semi-Regular Tessellation Dual Graphs

This paper shows NP-completeness for finding Hamiltonian cycles in induc...

Generalized Belief Propagation on Tree Robust Structured Region Graphs

This paper provides some new guidance in the construction of region grap...