A note on interconnecting matchings in graphs

DOI10.1016/j.disc.2006.05.011zbMath1101.05053OpenAlexW2053754021MaRDI QIDQ2509302

Tomáš Kaiser

Publication date: 19 October 2006

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

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

zbMATH Keywords

toughnessmatroid intersection2-walk

Mathematics Subject Classification ID

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

Cites Work

• The clique complex and hypergraph matching
• Domination numbers and homology
• Not every 2-tough graph is Hamiltonian
• Independent systems of representatives in weighted graphs
• Tough graphs and Hamiltonian circuits.
• The intersection of a matroid and a simplicial complex
• Toughness and the existence ofk-factors
• Hall's theorem for hypergraphs
• Toughness, trees, and walks
• Tough spiders
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on interconnecting matchings in graphs