scientific article; zbMATH DE number 1472162

zbMath0952.05062arXivmath/9912022MaRDI QIDQ4489216

Vadim E. Levit, Eugen Mandrescu

Publication date: 14 January 2001

Full work available at URL: https://arxiv.org/abs/math/9912022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingstability numberwell-covered graphvery well-covered graphKoenig-Egervary graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (14)

Combinatorial properties of the family of maximum stable sets of a graph ⋮ When is \(G^2\) a König-Egerváry graph? ⋮ A set and collection lemma ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Forbidden subgraphs and the König-Egerváry property ⋮ Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number ⋮ 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 the roots of independence polynomials of almost all very well-covered graphs ⋮ Well-covered graphs and factors ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ On \(\alpha\)-critical edges in König--Egerváry graphs ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph ⋮ The Clique Corona Operation and Greedoids

This page was built for publication: