|
|||||
|
|
A short proof of König's matching theorem |
|
| Authors: | Romeo Rizzi |
| Abstract: | We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover. © John Wiley & Sons, Inc. J Graph Theory 33: 138–139, 2000 |
| Keywords: | bipartite graph maximum matching minimum node cover |