On graphs whose maximal cliques and stable sets intersect

DOI10.1007/978-3-319-94830-0_2MaRDI QIDQ2315571zbMATH OpenOpenAlexFDO

Authors Endre Boros, Diogo V. Andrade, Vladimir Gurvich

Publication date 25 July 2019

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.4442

zbMATH Keywords

CIS-graphclique-kernel intersection property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
• On split and almost CIS-graphs
• A characterization of almost CIS graphs
• On CIS circulants
• Vertex-transitive CIS graphs

Cited in

(21)

• On split and almost CIS-graphs
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
• scientific article; zbMATH DE number 1161379 (Why is no real title available?)
• Unconditional reflexive polytopes
• Stable sets of maximal size in Kneser-type graphs
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• On equistable, split, CIS, and related classes of graphs
• Homothetic polygons and beyond: maximal cliques in intersection graphs
• On CIS circulants
• Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
• A characterization of almost CIS graphs
• Strong cliques in diamond-free graphs
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• scientific article; zbMATH DE number 5781390 (Why is no real title available?)
• A characterization of claw-free CIS graphs and new results on the order of CIS graphs
• Stable 2-pairs and \((X,Y)\)-intersection graphs
• On the number of vertices belonging to all maximum stable sets of a graph
• On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
• On the complexity of the independent set problem in triangle graphs
• Vertex-transitive CIS graphs

This page was built for publication: On graphs whose maximal cliques and stable sets intersect

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