On local maximum stable set greedoids
type: Item
instance of: scholarly article
title: On local maximum stable set greedoids
zbMATH Open document ID: 1238.05048
author: Vadim E. Levit
author: Eugen Mandrescu
published in: Discrete Mathematics
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5996533
zbMATH Keywords: interval greedoid
zbMATH Keywords: matroid
zbMATH Keywords: antimatroid
zbMATH Keywords: tree
zbMATH Keywords: bipartite graph
zbMATH Keywords: triangle-free graph
zbMATH Keywords: König-Egerváry graph
zbMATH Keywords: unicycle graph
zbMATH Keywords: well-covered graph
zbMATH Keywords: simplicial graph
MaRDI profile type: Publication
full work available at URL: j.disc.2011.04.015
OpenAlex ID: W2035499577
cites work: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
cites work: Q3919752
cites work: Introduction to Greedoids
cites work: On the number of vertices belonging to all maximum stable sets of a graph
cites work: Q3820628
cites work: A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem
cites work: Very well covered graphs
cites work: Q4457554
cites work: Uniquely restricted matchings
cites work: Graphs whose vertex independence number is unaffected by single edge addition or deletion
cites work: Graphs with unique maximum independent sets
cites work: Q3928230
cites work: Greedoids
cites work: On the structure of \(\alpha\)-stable graphs
cites work: Q2752151
cites work: A new greedoid: The family of local maximum stable sets of a forest
cites work: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
cites work: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
cites work: The Clique Corona Operation and Greedoids
cites work: Q3587708
cites work: Greedoids on Vertex Sets of Unicycle Graphs
cites work: Graph operations that are good for greedoids
cites work: On the core of a unicyclic graph
cites work: Vertex packings: Structural properties and algorithms
cites work: Some covering concepts in graphs
cites work: On unique independent sets in graphs
cites work: A characterization of the graphs in which the transversal number equals the matching number
cites work: A characterization of mixed branching greedoids
cites work: The structure and maximum number of maximum independent sets in trees
DOI: 10.1016/J.DISC.2011.04.015
description: scientific article; zbMATH DE number 5996533