Title of article
A degree condition implying that every matching is contained in a hamiltonian cycle
Author/Authors
Amar، نويسنده , , Denise and Flandrin، نويسنده , , Evelyne and Gancarzewicz، نويسنده , , Grzegorz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
3703
To page
3713
Abstract
We give a degree sum condition for three independent vertices under which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree sum is almost the best possible.
Keywords
cycle , Matching , hamiltonian cycle
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598866
Link To Document