Bipartite graphs with every matching in a cycle

DOI10.1016/J.DISC.2005.11.090zbMATH Open1117.05086OpenAlexW2067082140MaRDI QIDQ878652FDOQ878652

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cycles containing matchings and pairwise compatible euler tours
• Proof of a conjecture of Haeggkvist on cycles and independent edges
• HAMILTONIAN CYCLES THROUGH MATCHINGS

Cited In (6)

• Graphs with every matching contained in a cycle
• Spanning cycles through specified edges in bipartite graphs
• Title not available (Why is that?)
• EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K_2,n
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
• Hamilton cycles passing through a matching in a bipartite graph with high degree sum

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)