Clique covering of graphs

DOI10.1007/BF02579265zbMath0641.05030OpenAlexW2017711450MaRDI QIDQ1100482

László Pyber

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

clique covering number

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 ⋮ Edges Not Covered by Monochromatic Bipartite Graph ⋮ On the number of edges not covered by monochromatic copies of a fixed graph. ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ On edges not in monochromatic copies of a fixed bipartite graph

Cites Work

• Extremal clique coverings of complementary graphs
• The Representation of a Graph by Set Intersections
• Unnamed Item

This page was built for publication: Clique covering of graphs