Clique partitions of complements of forests and bounded degree graphs

DOI10.1016/j.disc.2007.04.041zbMath1158.05032OpenAlexW1998568320MaRDI QIDQ952663

Michael S. Cavers, Jacques Verstraete

Publication date: 12 November 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.041

zbMATH Keywords

Steiner systemsprobabilistic methodclique partitions

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

An overview of graph covering and partitioning ⋮ Short Proofs of Some Extremal Results

Cites Work

• Clique partitions of the cocktail party graph
• The Difference Between Consecutive Primes, II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clique partitions of complements of forests and bounded degree graphs