Q897769

From Wikidata
Jump to: navigation, search

König's theorem (Q897769)[edit]

theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs [edit]

No aliases defined. [add]

Statements

/m/0dn1zp
[edit]
1 reference
[add]
[edit]
0 references
[add]