A new constraint of the Hamilton cycle algorithm

10/19/2017
by   Heping Jiang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2018

A new proof of Grinberg Theorem based on cycle bases

Grinberg Theorem, a necessary condition only for planar Hamiltonian grap...
research
06/24/2019

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...
research
11/06/2019

Are highly connected 1-planar graphs Hamiltonian?

It is well-known that every planar 4-connected graph has a Hamiltonian c...
research
06/08/2023

Colouring planar graphs with a precoloured induced cycle

Let C be a cycle and f : V(C) →{c_1,c_2,…,c_k} a proper k-colouring of C...
research
04/15/2018

Hidden Hamiltonian Cycle Recovery via Linear Programming

We introduce the problem of hidden Hamiltonian cycle recovery, where the...
research
03/12/2023

Abstract Voronoi-like Graphs: Extending Delaunay's Theorem and Applications

Any system of bisectors (in the sense of abstract Voronoi diagrams) defi...
research
09/30/2019

Hamiltonicity in Semi-Regular Tessellation Dual Graphs

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

Please sign up or login with your details

Forgot password? Click here to reset