| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651086 | Discrete Mathematics | 2007 | 13 Pages |
Abstract
We give sufficient Ore-type conditions for a balanced bipartite graph to contain every matching in a hamiltonian cycle or a cycle not necessarily hamiltonian. Moreover, for the hamiltonian case we prove that the condition is almost best possible.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Paweł Wojda,