Not complementary connected and not CIS \(d\)-graphs form weakly monotone families

DOI10.1016/j.disc.2009.11.006zbMath1213.05219OpenAlexW2136818182WikidataQ59560562 ScholiaQ59560562MaRDI QIDQ966046

Diogo V. Andrade, Endre Boros, Vladimir A. Gurvich

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.006

zbMATH Keywords

Gallaiweakly monotone\(d\)-graphcomplementary connectedminimal and locally minimal

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (7)

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 exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Strong cliques in diamond-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Vertex- and edge-minimal and locally minimal graphs
• Minimal and locally minimal games and game forms
• A note on perfect graphs
• Modular decomposition and transitive orientation
• Graphs indecomposable with respect to the X-join
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• On graphs whose maximal cliques and stable sets intersect
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• A Characterization of Almost CIS Graphs
• Incremental modular decomposition
• Lambda composition
• Edge colorings of complete graphs without tricolored triangles
• Transitiv orientierbare Graphen

This page was built for publication: Not complementary connected and not CIS \(d\)-graphs form weakly monotone families