Graph operations that are good for greedoids

DOI10.1016/j.dam.2010.04.009zbMath1209.05184arXiv0809.1806OpenAlexW2060242641MaRDI QIDQ987691

Vadim E. Levit, Eugen Mandrescu

Publication date: 13 August 2010

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

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

zbMATH Keywords

coronagreedoidlocal maximum stable setZykov sum

Mathematics Subject Classification ID

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

Related Items (2)

Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On local maximum stable set greedoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedoids
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• A new greedoid: The family of local maximum stable sets of a forest
• Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
• Introduction to Greedoids
• Vertex packings: Structural properties and algorithms
• The Clique Corona Operation and Greedoids

This page was built for publication: Graph operations that are good for greedoids