Some good characterization results relating to the Kőnig-Egerváry theorem
From MaRDI portal
Publication:623797
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- A note on the complexity of the transportation problem with a permutable demand vector
- A short proof of Sperner's lemma
- A transportation problem with a permuted demand vector
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- Beyond the Erdős-Ko-Rado theorem
- Enumerative aspects of certain subclasses of perfect graphs
- Extremal problems concerning Kneser-graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Precoloring Extension III: Classes of Perfect Graphs
- Precoloring extension. I: Interval graphs
Cited in
(2)
This page was built for publication: Some good characterization results relating to the Kőnig-Egerváry theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623797)