Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648596 | Discrete Mathematics | 2009 | 11 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz,