On \(\alpha^{+}\)-stable König-Egerváry graphs

DOI10.1016/S0012-365X(02)00528-9zbMath1017.05086OpenAlexW46117055MaRDI QIDQ1869204

Eugen Mandrescu, Vadim E. Levit

Publication date: 9 April 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00528-9

zbMATH Keywords

stability numbermaximum matchingperfect matchingmaximum stable setblossom\(\alpha^+\)-stable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (20)

On some conjectures concerning critical independent sets of a graph ⋮ New results relating independence and matchings ⋮ Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ On the critical difference of almost bipartite graphs ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ Two more characterizations of König-Egerváry graphs ⋮ Critical and maximum independent sets of a graph ⋮ Critical independent sets and König-Egerváry graphs ⋮ A classification of 1-well-covered graphs ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On maximum matchings in König-Egerváry graphs ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ A characterization of Konig-Egervary graphs using a common property of all maximum matchings ⋮ On \(\alpha\)-critical edges in König--Egerváry graphs ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ Monotonic properties of collections of maximum independent sets of a graph ⋮ On an annihilation number conjecture ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph

This page was built for publication: On \(\alpha^{+}\)-stable König-Egerváry graphs