Some good characterization results relating to the Kőnig-Egerváry theorem
From MaRDI portal
Publication:623797
DOI10.1007/S10100-009-0126-YzbMATH Open1204.15038OpenAlexW2121062154MaRDI QIDQ623797FDOQ623797
Publication date: 8 February 2011
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-009-0126-y
Recommendations
Matrices of integers (15B36) Coloring of graphs and hypergraphs (05C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Extremal problems concerning Kneser-graphs
- Precoloring extension. I: Interval graphs
- Title not available (Why is that?)
- A short proof of Sperner's lemma
- Precoloring Extension III: Classes of Perfect Graphs
- Beyond the Erdős-Ko-Rado theorem
- Enumerative aspects of certain subclasses of perfect graphs
- A transportation problem with a permuted demand vector
- A note on the complexity of the transportation problem with a permutable demand vector
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
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)
