scientific article; zbMATH DE number 5781390

MaRDI QIDQ3587708zbMATH OpenFDO

Authors Vadim E. Levit, Eugen Mandrescu

Publication date 8 September 2010

zbMATH Keywords

well-covered graphmaximum stable setgreedoidcorona of graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On duality between local maximum stable sets of a graph and its line-graph
• Maximum stable sets in analogs of Kneser and complete graphs
• Local maximum stable set greedoids stemming from very well-covered graphs
• On the number of vertices belonging to all maximum stable sets of a graph
• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
• On graphs whose maximal cliques and stable sets intersect
• scientific article; zbMATH DE number 4063154
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• Combinatorial properties of the family of maximum stable sets of a graph
• Stable sets of maximal size in Kneser-type graphs

Cited in

(5)

• On local maximum stable set 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
• Crowns in bipartite graphs

This page was built for publication:

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