König's theorem states that, in bipartite graphs, the maximum matching
is equal in size to the minimum vertex cover. Via this result, the
minimum vertex cover, maximum independent set, and maximum vertex
biclique problems may be solved in polynomial time for bipartite
König's theorem states about the relation between sizes of the maximum matching
and of the minimum vertex cover, not about conversion between any two of the four: the maximum matching, minimum vertex cover, maximum independent set, and maximum vertex biclique. So I wonder how to understand the sentence in bold?