Pages that link to "Item:Q1897443"
From MaRDI portal
The following pages link to Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs (Q1897443):
Displaying 19 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On CIS circulants (Q394314) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs (Q993683) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← 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)
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q2132328) (← links)
- Unconditional reflexive polytopes (Q2197693) (← links)
- Detecting strong cliques (Q2312812) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- (Q3587708) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)
