(Q897769)

English

König's theorem

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

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit