Hall's and Kőnig's theorem in graphs and hypergraphs
From MaRDI portal
(Redirected from Publication:1660258)
Recommendations
Cites work
- A characterization of the graphs in which the transversal number equals the matching number
- Critical independent sets and König-Egerváry graphs
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Matching theory
- Normal hypergraphs and the perfect graph conjecture
- Perfect matchings in balanced hypergraphs
- Perfect matchings in balanced hypergraphs---a combinatorial approach
- Some Properties of Graphs with Multiple Edges
- The fractional matching numbers of graphs
Cited in
(15)- Halin's theorem for cubic graphs on an annulus
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- On automorphisms of direct products of Cayley graphs on abelian groups
- Train rotation optimization
- Some more updates on an annihilation number conjecture: pros and cons
- The Hall-Janko graph and the Witt system \(W_{10}\)
- Hall ratio of the Mycielski graphs
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- scientific article; zbMATH DE number 3882481 (Why is no real title available?)
- scientific article; zbMATH DE number 3914364 (Why is no real title available?)
- A game generalizing Hall's theorem
- Hall's theorem for hypergraphs
- On an annihilation number conjecture
- A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
- Some good characterization results relating to the Kőnig-Egerváry theorem
This page was built for publication: Hall's and Kőnig's theorem in graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660258)