Handbook of combinatorics (vol. 1)
On the number of vertices belonging to all maximum stable sets of a graph
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
On α+-stable König-Egerváry graphs
Discrete Mathematics
Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
Discrete Applied Mathematics
König–Egerváry Graphs are Non-Edmonds
Graphs and Combinatorics
The critical independence number and an independence decomposition
European Journal of Combinatorics
Critical Independent Sets and König–Egerváry Graphs
Graphs and Combinatorics
Forbidden subgraphs and the König-Egerváry property
Discrete Applied Mathematics
Note: On the intersection of all critical sets of a unicyclic graph
Discrete Applied Mathematics
| Hi-index | 0.04 |
For a graph G let @a(G),@m(G), and @t(G) denote its independence number, matching number, and vertex cover number, respectively. If @a(G)+@m(G)=|V(G)| or, equivalently, @m(G)=@t(G), then G is a Konig-Egervary graph. In this paper we give a new characterization of Konig-Egervary graphs.