On \(\alpha^{+}\)-stable König-Egerváry graphs
From MaRDI portal
Publication:1869204
DOI10.1016/S0012-365X(02)00528-9zbMath1017.05086MaRDI 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
stability number; maximum matching; perfect matching; maximum stable set; blossom; \(\alpha^+\)-stable graph
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On an annihilation number conjecture, A classification of 1-well-covered graphs, On König-Egerváry collections of maximum critical independent sets, Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs, When is \(G^2\) a König-Egerváry graph?, Local maximum stable set greedoids stemming from very well-covered graphs, On the intersection of all critical sets of a unicyclic graph, Critical and maximum independent sets of a graph, Critical independent sets and König-Egerváry graphs, New results relating independence and matchings, On the critical difference of almost bipartite graphs, Monotonic properties of collections of maximum independent sets of a graph, Two more characterizations of König-Egerváry graphs, On maximum matchings in König-Egerváry graphs, Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids, On \(\alpha\)-critical edges in König--Egerváry graphs, On some conjectures concerning critical independent sets of a graph, A characterization of Konig-Egervary graphs using a common property of all maximum matchings, VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS, On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph
