König's theorem (Q897769)

From Wikidata
Jump to: navigation, search
theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
    No aliases defined
[edit]
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

    /m/0dn1zp
    1 reference
    0 references