A new greedoid: The family of local maximum stable sets of a forest

DOI10.1016/S0166-218X(01)00332-8zbMath1007.05083arXivmath/9912222OpenAlexW2078342963MaRDI QIDQ1850118

Eugen Mandrescu, Vadim E. Levit

Publication date: 2 December 2002

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

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

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (14)

On unicyclic graphs with uniquely restricted maximum matchings ⋮ Critical sets, crowns and local maximum independent sets ⋮ Critical independent sets and König-Egerváry graphs ⋮ Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On local maximum stable set greedoids ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Crowns in bipartite graphs ⋮ Graph operations that are good for greedoids ⋮ On König-Egerváry collections of maximum critical independent sets ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph ⋮ The Clique Corona Operation and Greedoids ⋮ Unicycle graphs and uniquely restricted maximum matchings

Cites Work

• Unnamed Item
• Graphs whose vertex independence number is unaffected by single edge addition or deletion
• Greedoids
• The structure and maximum number of maximum independent sets in trees
• Introduction to Greedoids
• Vertex packings: Structural properties and algorithms
• Reducing the adjacency matrix of a tree

This page was built for publication: A new greedoid: The family of local maximum stable sets of a forest