Title of article :
Hamiltonian cycles and paths through matchings
Author/Authors :
Amar، نويسنده , , Denise and Flandrin، نويسنده , , Evelyne and Gancarzewicz، نويسنده , , Grzegorz، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Abstract :
We give sufficient degree-sum conditions for a graph to contain every matching in a hamiltonian cycle or a hamiltonian path. Moreover we prove that some results are almost best possible.
Keywords :
cycle , hamiltonian cycle , Matching
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
