Abstract :
Suppose G is a graph, F is a 1-factor of G. G is called F-Hamiltonian, if there exists a Hamiltonian cycle containing F in G. In this paper, two necessary and sufficient conditions for a general graph and a bipartite graph being F-Hamiltonian are provided, respectively.
