König's theorem gives you a minimum vertex cover for free once you have a maximum matching. The cover consists of: matched vertices in reachable from unmatched via alternating paths, plus matched vertices in not reachable.
This is useful for problems asking to select minimum vertices to cover all edges. Compute max matching, then construct the vertex cover using the reachability approach.