|
|||||
|
|
Variation on a theorem of König |
|
| Authors: | D de Werra |
| Institution: | Département de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland |
| Abstract: | A min-max property of bipartite graphs is stated; it is a variation on the theorem of König ‘maximum matching = minimum covering’; one shows that a certain inequality holds for any graph and the equality for bipartite graphs is derived from a simple network flow model. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |