On split and almost CIS-graphs

MaRDI QIDQ3614023zbMATH OpenFDO

Authors Endre Boros, Vladimir Gurvich, I.È. Zverovich

Publication date 16 March 2009

Mathematics Subject Classification ID

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

Recommendations

• A characterization of almost CIS graphs
• On graphs whose maximal cliques and stable sets intersect
• On equistable, split, CIS, and related classes of graphs
• Recognizing Perfect 2-Split Graphs
• Split-neighbourhood graphs and the strong perfect graph conjecture

Cited in

(17)

• On splitting the Clebsch graph
• Subdivided claws and the clique-stable set separation property
• A characterization of claw-free CIS graphs and new results on the order of CIS graphs
• Recognition of split-graphic sequences
• On the complexity of the independent set problem in triangle graphs
• Detecting strong cliques
• On graphs whose maximal cliques and stable sets intersect
• On class 2 split graphs
• On equistable, split, CIS, and related classes of graphs
• A characterization of almost CIS graphs
• On CIS circulants
• Vertex-transitive CIS graphs
• Strong cliques in vertex‐transitive graphs
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• More on discrete convexity
• Not complementary connected and not CIS d-graphs form weakly monotone families
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited

This page was built for publication: On split and almost CIS-graphs

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