On graphs whose maximal cliques and stable sets intersect
From MaRDI portal
Publication:2315571
DOI10.1007/978-3-319-94830-0_2zbMath1416.05203OpenAlexW2147800344MaRDI QIDQ2315571
Endre Boros, Diogo V. Andrade, Vladimir A. Gurvich
Publication date: 25 July 2019
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.4442
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ On CIS circulants ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Unconditional reflexive polytopes ⋮ Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs ⋮ Vertex-transitive CIS graphs ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ On the complexity of the independent set problem in triangle graphs ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Strong cliques in diamond-free graphs
This page was built for publication: On graphs whose maximal cliques and stable sets intersect
