Title of article
Hamiltonian cycles and paths through matchings
Author/Authors
Amar، نويسنده , , Denise and Flandrin، نويسنده , , Evelyne and Gancarzewicz، نويسنده , , Grzegorz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
543
To page
547
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
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454234
Link To Document