Bipartite graphs with every matching in a cycle
From MaRDI portal
(Redirected from Publication:878652)
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
Cites work
Cited in
(12)- Lexicographic matchings cannot form Hamiltonian cycles
- Large deviation asymptotics for busy periods
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- A proof on cycles and matching in balanced bipartite graphs
- Graphs with every matching contained in a cycle
- Bipartite graphs with every \(k\)-matching in a Hamiltonian cycle.
- EVERY LINK IS A BOUNDARY OF A COMPLETE BIPARTITE GRAPH K2,n
- Hamilton cycles passing through a matching in a bipartite graph with high degree sum
- Spanning cycles through specified edges in bipartite graphs
- scientific article; zbMATH DE number 1506971 (Why is no real title available?)
- 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)