A note on interconnecting matchings in graphs
From MaRDI portal
(Redirected from Publication:2509302)
Recommendations
- Matching connectivity: on the structure of graphs with perfect matchings
- scientific article; zbMATH DE number 1135678
- On maximal matchings of connected graphs
- On matchings in graphs
- The connectivity of maximum matching graphs
- Connected matchings and Hadwiger's conjecture
- scientific article; zbMATH DE number 1808637
- scientific article; zbMATH DE number 1953189
- Matching and edge-connectivity in regular graphs
- scientific article; zbMATH DE number 867631
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 68918 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Domination numbers and homology
- Hall's theorem for hypergraphs
- Independent systems of representatives in weighted graphs
- Not every 2-tough graph is Hamiltonian
- The clique complex and hypergraph matching
- The intersection of a matroid and a simplicial complex
- Tough graphs and Hamiltonian circuits.
- Tough spiders
- Toughness and the existence ofk-factors
- Toughness, trees, and walks
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: A note on interconnecting matchings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509302)
