Variation on a theorem of König
✍
D. de Werra
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 334 KB
A min-max property of bipartite graphs is stated; it is a variation on the theorem of Kiinig 'maximum x%zhing= minimum covering'; one shows that a c&&i inequaliw holds for any graph and the equality for bipartite graphs is derived from a simple network flow model. -. ## Various extensions of the t