Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs

DOI10.1007/BF01212980zbMath0813.05036OpenAlexW2086045849MaRDI QIDQ1340140

Sean McGuinness

Publication date: 18 May 1995

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212980

zbMATH Keywords

maximal cliquesTurán graphclique decompositiongreedy clique decompositions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Greedy maximum-clique decompositions ⋮ Greedy clique decompositions and the Turán numbers

Cites Work

• Unnamed Item
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• The greedy clique decomposition of a graph
• The Representation of a Graph by Set Intersections

This page was built for publication: Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs