On the structure of \(\alpha\)-stable graphs

DOI10.1016/S0012-365X(00)00444-1zbMath0995.05121arXivmath/9911227OpenAlexW2251473351MaRDI QIDQ5959104

Eugen Mandrescu, Vadim E. Levit

Publication date: 24 October 2002

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

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

zbMATH Keywords

stability numberchordal graphperfect matchingsstability system

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 (4)

On graphs admitting two disjoint maximum independent sets ⋮ 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 ⋮ On local maximum stable set greedoids

This page was built for publication: On the structure of \(\alpha\)-stable graphs