Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
From MaRDI portal
Recommendations
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- Notes on Chvátal's conjecture
- Covering all cliques of a graph
- On Chvàtal's conjecture and a conjecture on families of signed sets
Cites work
Cited in
(12)- Strong cliques in diamond-free graphs
- More on discrete convexity
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- Vertex-transitive CIS graphs
- On CIS circulants
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- Not complementary connected and not CIS d-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Notes on Chvátal's conjecture
This page was built for publication: Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598473)