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

page 1

page 2

page 3

page 4

research
10/19/2017

A new constraint of the Hamilton cycle algorithm

Grinberg's theorem is a necessary condition for the planar Hamilton grap...
research
04/03/2023

Canonical decompositions of 3-connected graphs

We offer a new structural basis for the theory of 3-connected graphs, pr...
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
10/16/2012

Generalized Belief Propagation on Tree Robust Structured Region Graphs

This paper provides some new guidance in the construction of region grap...
research
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,...
research
09/30/2022

Graphs with the same truncated cycle matroid

The classical Whitney's 2-Isomorphism Theorem describes the families of ...
research
09/06/2023

There are only two paradoxes

Using a graph representation of classical logic, the paper shows that th...

Please sign up or login with your details

Forgot password? Click here to reset