Bipartite graphs with every matching in a cycle
From MaRDI portal
Publication:878652
DOI10.1016/J.DISC.2005.11.090zbMATH Open1117.05086OpenAlexW2067082140MaRDI QIDQ878652FDOQ878652
Authors: Grzegorz Gancarzewicz, Denise Amar, Evelyne Flandrin, 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
Recommendations
- Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle.
- Ore and Erdős type conditions for long cycles in balanced bipartite graphs
- A proof on cycles and matching in balanced bipartite graphs
- Hamiltonian cycles and paths through matchings
- Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (11)
- Graphs with every matching contained in a cycle
- Spanning cycles through specified edges in bipartite graphs
- Title not available (Why is that?)
- Large deviation asymptotics for busy periods
- EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K2,n
- On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
- Lexicographic matchings cannot form Hamiltonian cycles
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- Hamilton cycles passing through a matching in a bipartite graph with high degree sum
- A proof on cycles and matching in balanced bipartite graphs
- Hamiltonian cycles and paths through matchings
This page was built for publication: Bipartite graphs with every matching in a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878652)
