On local maximum stable set greedoids

DOI10.1016/J.DISC.2011.04.015zbMATH Open1238.05048OpenAlexW2035499577MaRDI QIDQ658102FDOQ658102

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

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

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)

Cites Work

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

Cited In (7)

• Forbidden subgraphs and the König-Egerváry property
• Greedoids on vertex sets of \(B\)-joins of graphs
• A greedy algorithm for interval greedoids
• Graph operations that are good for 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
• Very well-covered graphs of girth at least four and local maximum stable set 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)