König's theorem (Q897769)
Jump to navigation
Jump to search
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
- König–Hall theorem
- König–Egerváry theorem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | König's theorem |
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs |
|
Statements
1 reference
Identifiers
Sitelinks
Wikipedia(12 entries)
- dewiki Satz von König (Graphentheorie)
- enwiki Kőnig's theorem (graph theory)
- eswiki Teorema de König (teoría de grafos)
- fawiki قضیه کونیگ
- frwiki Théorème de Kőnig (théorie des graphes)
- hewiki משפט קניג (תורת הגרפים)
- hrwiki Königov poučak (teorija grafova)
- huwiki Kőnig-tétel (gráfelmélet)
- kowiki 쾨니그의 정리
- ruwiki Теорема Кёнига (комбинаторика)
- ukwiki Теорема Кеніга (комбінаторика)
- zhwiki 柯尼希定理 (图论)