Extremal clique coverings of complementary graphs

DOI10.1007/BF02579256zbMath0616.05042OpenAlexW2138479178WikidataQ56850772 ScholiaQ56850772MaRDI QIDQ1821116

N. J. Pullmann, Nicholas C. Wormald, Dominique De Caen

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

extremal problemclique covering numberclique partition numbercomplementary graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Regarding two conjectures on clique and biclique partitions ⋮ Spectral radius and clique partitions of graphs ⋮ An overview of graph covering and partitioning ⋮ Clique covering of graphs ⋮ Clique coverings and claw-free graphs

Cites Work

• Clique coverings of graphs V: maximal-clique partitions
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal clique coverings of complementary graphs