Title of article
Bipartite graphs with every matching in a cycle Original Research Article
Author/Authors
Denise Amar، نويسنده , , Evelyne Flandrin، نويسنده , , Grzegorz Gancarzewicz، نويسنده , , A. Pawel Wojda، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
13
From page
1525
To page
1537
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.
Keywords
Bipartite graph , Matching , Cycle , Hamiltonian cycle
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947803
Link To Document