A New Property of Hamilton Graphs

A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this paper, we give out some new kind of definitions of the subgraphs and determine the Hamiltoncity of edges according to the existence of the subgraphs in a graph, and then obtain a new property of Hamilton graphs as being a necessary and sufficient condition characterized in the connectivity of the subgraph that induced from the cycle structure of a given graph.

💡 Research Summary

The paper tackles the classic Hamiltonian cycle problem by introducing a novel structural criterion that hinges on the connectivity of subgraphs induced by cycles within a given graph. The authors first define a “cycle‑induced subgraph”: for any cycle C in a graph G, the subgraph G