A new proof of Grinberg Theorem based on cycle bases

07/26/2018
by   Heping Jiang, et al.
0

Grinberg Theorem, a necessary condition only for planar Hamiltonian graphs, was proved in 1968. In this paper, using the cycles in a cycle basis of a simple connected graph to replace the faces in planar graphs, we give a new proof of Grinberg Theorem. This result implies that Grinberg Theorem based on cycle bases can be extended to survey Hamiltoncity of simple connected graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/19/2017

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...
11/06/2019

Are highly connected 1-planar graphs Hamiltonian?

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

Generalized Belief Propagation on Tree Robust Structured Region Graphs

This paper provides some new guidance in the construction of region grap...
07/30/2019

Feasible bases for a polytope related to the Hamilton cycle problem

We study a certain polytope depending on a graph G and a parameter β∈(0,...
04/07/2021

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...
11/06/2020

Algorithmic Extensions of Dirac's Theorem

In 1952, Dirac proved the following theorem about long cycles in graphs ...
02/18/2020

Dynamics of Cycles in Polyhedra I: The Isolation Lemma

A cycle C of a graph G is isolating if every component of G-V(C) is a si...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.