For a graph G let α(G),μ(G), and τ(G) denote its independence number, matching number, and vertex cover number, respectively. If α(G)+μ(G)=|V(G)| or, equivalently, μ(G)=τ(G), then G is a König-Egerváry graph. In this paper we give a new characterization of König-Egerváry graphs.
- Maximum independent set
- Maximum matching