Bipartite graphs with every matching in a cycle

DOI10.1016/J.DISC.2005.11.090zbMath1117.05086OpenAlexW2067082140MaRDI QIDQ878652

Grzegorz Gancarzewicz, Evelyne Flandrin, Denise Amar, Adam Paweł Wojda

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.090

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Spanning Cycles Through Specified Edges in Bipartite Graphs ⋮ Hamilton cycles passing through a matching in a bipartite graph with high degree sum ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of a conjecture of Haeggkvist on cycles and independent edges
• HAMILTONIAN CYCLES THROUGH MATCHINGS
• Cycles containing matchings and pairwise compatible euler tours

This page was built for publication: Bipartite graphs with every matching in a cycle