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

DOI10.1016/J.DISC.2009.11.006MaRDI QIDQ966046zbMATH OpenOpenAlexWikidataFDO

Authors Diogo V. Andrade, Endre Boros, Vladimir 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)

Recommendations

• On graphs whose maximal cliques and stable sets intersect
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Gallai colorings of non-complete graphs
• On split and almost CIS-graphs
• Colored graphs without colorful cycles

Cites work

• scientific article; zbMATH DE number 3819502 (Why is no real title available?)
• scientific article; zbMATH DE number 3974977 (Why is no real title available?)
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• scientific article; zbMATH DE number 3545568 (Why is no real title available?)
• A characterization of almost CIS graphs
• A characterization of perfect graphs
• A note on perfect graphs
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Edge colorings of complete graphs without tricolored triangles
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• Graphs indecomposable with respect to the X-join
• Incremental modular decomposition
• Lambda composition
• Minimal and locally minimal games and game forms
• Modular decomposition and transitive orientation
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• On graphs whose maximal cliques and stable sets intersect
• On split and almost CIS-graphs
• Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
• Transitiv orientierbare Graphen
• Vertex- and edge-minimal and locally minimal graphs

Cited in

(9)

• On equistable, split, CIS, and related classes of graphs
• On graphs whose maximal cliques and stable sets intersect
• Strong cliques in diamond-free graphs
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• More on discrete convexity
• A characterization of claw-free CIS graphs and new results on the order of 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
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited

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

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