A Characterization of Almost CIS Graphs

DOI10.1137/080723739zbMath1191.05073OpenAlexW2101045173MaRDI QIDQ3563939

Wenan Zang, Cun-Quan Zhang, Ye-Zhou Wu

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080723739

zbMATH Keywords

algorithmgraphstable setclique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On equistable, split, CIS, and related classes of graphs ⋮ On CIS circulants ⋮ Strong cliques in vertex‐transitive graphs ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Vertex-transitive CIS graphs ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Detecting strong cliques

This page was built for publication: A Characterization of Almost CIS Graphs