The Clique Corona Operation and Greedoids

DOI10.1007/978-3-540-85097-7_36zbMath1168.05360OpenAlexW2125057284MaRDI QIDQ5505676

Eugen Mandrescu, Vadim E. Levit

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_36

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Local maximum stable set greedoids stemming from very well-covered graphs ⋮ On local maximum stable set greedoids ⋮ Graph operations that are good for greedoids ⋮ On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedoids
• A characterization of well covered graphs of girth 5 or greater
• The structure of well-covered graphs and the complexity of their recognition problems
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• Very well covered graphs
• A new greedoid: The family of local maximum stable sets of a forest
• On 4-connected claw-free well-covered graphs
• Well-covered claw-free graphs
• Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
• Complexity results for well‐covered graphs
• Introduction to Greedoids
• Vertex packings: Structural properties and algorithms
• WELL-COVERED GRAPHS: A SURVEY
• Well covered simplicial, chordal, and circular arc graphs
• Some covering concepts in graphs

This page was built for publication: The Clique Corona Operation and Greedoids