A short proof of K�nig's matching theorem
From MaRDI portal
Publication:4948507
DOI<138::AID-JGT2>3.0.CO;2-K 10.1002/(SICI)1097-0118(200003)33:3<138::AID-JGT2>3.0.CO;2-KzbMath0981.05082OpenAlexW2615277347MaRDI QIDQ4948507
Publication date: 14 March 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200003)33:3<138::aid-jgt2>3.0.co;2-k
Related Items (4)
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number ⋮ Oriented star packings ⋮ An improved approximation for maximum \(k\)-dependent set on bipartite graphs ⋮ Surface Embedding of Non-Bipartite $k$-Extendable Graphs
This page was built for publication: A short proof of K�nig's matching theorem
