On local maximum stable set greedoids

DOI10.1016/j.disc.2011.04.015zbMath1238.05048OpenAlexW2035499577MaRDI QIDQ658102

Vadim E. Levit, Eugen Mandrescu

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.015

zbMATH Keywords

treebipartite graphantimatroidmatroidtriangle-free graphsimplicial graphwell-covered graphKönig-Egerváry graphinterval greedoidunicycle graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

A greedy algorithm for interval greedoids ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Forbidden subgraphs and the König-Egerváry property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the graphs in which the transversal number equals the matching number
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• Greedoids
• A characterization of mixed branching greedoids
• Graph operations that are good for greedoids
• Graphs with unique maximum independent sets
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• On unique independent sets in graphs
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• Very well covered graphs
• On the number of vertices belonging to all maximum stable sets of a graph
• 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
• Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
• Greedoids on Vertex Sets of Unicycle Graphs
• The structure and maximum number of maximum independent sets in trees
• Introduction to Greedoids
• Vertex packings: Structural properties and algorithms
• On the core of a unicyclic graph
• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
• The Clique Corona Operation and Greedoids
• Some covering concepts in graphs
• Uniquely restricted matchings
• On the structure of \(\alpha\)-stable graphs

This page was built for publication: On local maximum stable set greedoids