| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949504 | Discrete Applied Mathematics | 2017 | 6 Pages |
Abstract
In this paper, we prove that G is a König-Egerváry graph if and only if for every two maximum independent sets S1,S2 of G, there is a matching from V(G)âS1âªS2 into S1â©S2. Moreover, the same is true, when instead of two sets S1 and S2 we consider an arbitrary König-Egerváry collection.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Adi Jarden, Vadim E. Levit, Eugen Mandrescu,