Matchings · Independent Sets and Covers

Lesson 5

Nikolai Chukhin · Alexander S. Kulikov

Problem. Find \(\beta'(G)\), i.e., the minimum size of an edge cover in the graph \(G\) shown below.

5 points