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.
    [edit]

    Statements

    /m/0dn1zp
    1 reference
    0 references