A new proof of Grinberg Theorem based on cycle bases

07/26/2018

∙

by   Heping Jiang, et al.

∙

0

∙

share

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.