On the difference between hamilton cycles and 2-factors with a prescribed number of cycles
References (15)
A remark on two sufficient conditions for hamilton cycles
Discrete Math.
(1978)- et al.
A note on hamiltonian circuits
Discrete Math.
(1972) Generalizations of Dirac's theorem in hamiltonian graph theory – a survey
Discrete Math.
(2013)On the maximum number of independent cycles in a graph
Discrete Math.
(1999)On degree sum conditions for long cycles and cycles through specified vertices
Discrete Math.
(2008)An improvement of Fraisse's sufficient condition for hamiltonian graphs
J. Graph Theory
(1992)Longest paths and cycles in graphs with high degree
(1980)
There are more references available in the full text version of this article.
Cited by (0)
© 2017 Elsevier B.V. All rights reserved.