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
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

    0 references
    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit