Hall's and Kőnig's theorem in graphs and hypergraphs
From MaRDI portal
Publication:1660258
DOI10.1016/J.DISC.2018.06.013zbMath1393.05204OpenAlexW2884233753MaRDI QIDQ1660258
Isabel Beckenbach, Ralf Borndörfer
Publication date: 15 August 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.013
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
Some more updates on an annihilation number conjecture: pros and cons ⋮ On automorphisms of direct products of Cayley graphs on abelian groups ⋮ On an annihilation number conjecture ⋮ Train rotation optimization
Cites Work
- A characterization of the graphs in which the transversal number equals the matching number
- Matching theory
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Perfect matchings in balanced hypergraphs---a combinatorial approach
- Critical independent sets and König-Egerváry graphs
- Normal hypergraphs and the perfect graph conjecture
- Perfect matchings in balanced hypergraphs
- The fractional matching numbers of graphs
- Some Properties of Graphs with Multiple Edges
- Unnamed Item
- Unnamed Item
This page was built for publication: Hall's and Kőnig's theorem in graphs and hypergraphs