Pages that link to "Item:Q2519792"

The following pages link to Maximum stable sets in analogs of Kneser and complete graphs (Q2519792):

Displaying 12 items.

• Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
• Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
• On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
• On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← links)
• The number of all stable sets in some classes of graphs (Q2782801) (← links)
• (Q3587708) (← links)
• (Q4696202) (← links)
• Sink-Stable Sets of Digraphs (Q5246079) (← links)
• Maximum acyclic and fragmented sets in regular graphs (Q5441408) (← links)