Greedy maximum-clique decompositions

DOI10.1007/BF01212981zbMATH Open0813.05037OpenAlexW2047022952MaRDI QIDQ1340141FDOQ1340141

Authors 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/bf01212981

zbMATH Keywords

maximum cliquesclique decomposition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 1792630
• The greedy clique decomposition of a graph
• Greedy clique decompositions and the Turán numbers

Cites work

• scientific article; zbMATH DE number 4196017 (Why is no real title available?)
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
• The Representation of a Graph by Set Intersections
• The greedy clique decomposition of a graph

Cited in

(7)

• The greedy clique decomposition of a graph
• Greedy friendship decompositions of graphs
• Decomposing graphs into edges and triangles
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• An algorithm for the decomposition of graphs into cliques
• scientific article; zbMATH DE number 1792630 (Why is no real title available?)
• Greedy clique decompositions and the Turán numbers

This page was built for publication: Greedy maximum-clique decompositions

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