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

    0 references
    [edit]
    Language Code Linked page
    Deutsch dewiki
    English enwiki
    فارسی fawiki
    français frwiki
    magyar huwiki
    한국어 kowiki
    русский ruwiki
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]