• Corpus ID: 15359664

A New Property of Hamilton Graphs

@article{Jiang2015ANP,
  title={A New Property of Hamilton Graphs},
  author={Heping Jiang},
  journal={ArXiv},
  year={2015},
  volume={abs/1508.00068}
}
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… 

Figures from this paper

References

SHOWING 1-3 OF 3 REFERENCES

A sufficient condition for a graph to be hamiltonian

Those non-hamiltonian graphsG withn vertices are characterized, which satisfy the Ore-type degree-conditiond(x)+d(y)≥n−2 for each pairx,y∉M of different nonadjacent vertices whereM consists of two

Advances on the Hamiltonian Problem – A Survey

TLDR
This article is intended as a survey, updating earlier surveys in the area and contains material on closely related topics such as traceable, pancyclic and hamiltonian-connected graphs and digraphs.

Graph Theory with Applications, Fifth Printing

  • Graph Theory with Applications, Fifth Printing
  • 1982