Some good characterization results relating to the Kőnig-Egerváry theorem

DOI10.1007/s10100-009-0126-yzbMath1204.15038OpenAlexW2121062154MaRDI QIDQ623797

Mihály Hujter

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

zbMATH Keywords

good characterizationKőnig-Egerváry theorem

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Coloring of graphs and hypergraphs (05C15) Matrices of integers (15B36)

Related Items (1)

Special issue in honour of Jenő Egerváry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems concerning Kneser-graphs
• Beyond the Erdős-Ko-Rado theorem
• Precoloring extension. I: Interval graphs
• Enumerative aspects of certain subclasses of perfect graphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• 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
• Precoloring Extension III: Classes of Perfect Graphs
• A short proof of Sperner's lemma

This page was built for publication: Some good characterization results relating to the Kőnig-Egerváry theorem