A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Hamiltonian Factors In Hamiltonian Graphs
2009
Zenodo
Preserved Fulltext
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor.
doi:10.5281/zenodo.1070506
fatcat:mzbouj7shjflljxaa6otmm25ua