On local maximum stable set greedoids

DOI10.1016/J.DISC.2011.04.015MaRDI QIDQ658102zbMATH OpenOpenAlexFDO

Authors 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 graphmatroidwell-covered graphtriangle-free graphantimatroidinterval greedoidsimplicial graphunicycle graphKönig-Egerváry graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Local maximum stable set greedoids stemming from very well-covered graphs
• A new greedoid: The family of local maximum stable sets of a forest
• Graph operations that are good for greedoids
• Greedoids on Vertex Sets of Unicycle Graphs
• Very well-covered graphs of girth at least four and local maximum stable set greedoids

Cites work

• scientific article; zbMATH DE number 1665451 (Why is no real title available?)
• scientific article; zbMATH DE number 5781390 (Why is no real title available?)
• scientific article; zbMATH DE number 4093496 (Why is no real title available?)
• scientific article; zbMATH DE number 3732108 (Why is no real title available?)
• scientific article; zbMATH DE number 3742601 (Why is no real title available?)
• scientific article; zbMATH DE number 2061805 (Why is no real title available?)
• A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
• A characterization of mixed branching greedoids
• A characterization of the graphs in which the transversal number equals the matching number
• A new greedoid: The family of local maximum stable sets of a forest
• Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
• Graph operations that are good for greedoids
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• Graphs with unique maximum independent sets
• Greedoids
• Greedoids on Vertex Sets of Unicycle Graphs
• Independence numbers of graphs - an extension of the Koenig-Egervary theorem
• Introduction to Greedoids
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• On the core of a unicyclic graph
• On the number of vertices belonging to all maximum stable sets of a graph
• On the structure of \(\alpha\)-stable graphs
• On unique independent sets in graphs
• Some covering concepts in graphs
• The Clique Corona Operation and Greedoids
• The structure and maximum number of maximum independent sets in trees
• Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
• Uniquely restricted matchings
• Vertex packings: Structural properties and algorithms
• Very well covered graphs

Cited in

(7)

• Forbidden subgraphs and the König-Egerváry property
• Graph operations that are good for greedoids
• Very well-covered graphs of girth at least four and local maximum stable set greedoids
• Local maximum stable set greedoids stemming from very well-covered graphs
• A new greedoid: The family of local maximum stable sets of a forest
• Greedoids on vertex sets of \(B\)-joins of graphs
• A greedy algorithm for interval greedoids

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658102)