| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514614 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz,