The clique structure of a graph

MaRDI QIDQ5457646zbMATH OpenFDO

Authors Gabriela Alexe, Sorin Alexe

Publication date 14 April 2008

zbMATH Keywords

perfect graphssuperfragile graphsthe clique structure of a graphtreshold graphstrivially perfect graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On clique-perfect and K-perfect graphs
• scientific article; zbMATH DE number 846971
• scientific article; zbMATH DE number 2096431
• scientific article; zbMATH DE number 3859178
• Clique-perfectness of complements of line graphs

Cited in

(6)

• Clique-gated graphs
• Special data structures for problems on graphs associated with the notion of clique or with modular decomposition
• The clique density theorem
• scientific article; zbMATH DE number 4139786 (Why is no real title available?)
• scientific article; zbMATH DE number 1944140 (Why is no real title available?)
• The typical structure of graphs with no large cliques

This page was built for publication: The clique structure of a graph

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