Clique partitions of complements of forests and bounded degree graphs

DOI10.1016/J.DISC.2007.04.041MaRDI QIDQ952663zbMATH OpenOpenAlexFDO

Authors M. Cavers, J. Verstraëte

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

probabilistic methodSteiner systemsclique partitions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3914369
• Clique partitions and clique coverings
• Clique partitions of the cocktail party graph
• scientific article; zbMATH DE number 3954979
• Clique Partitions of Chordal Graphs

Cites work

• scientific article; zbMATH DE number 4160751 (Why is no real title available?)
• scientific article; zbMATH DE number 3914369 (Why is no real title available?)
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• Clique partitions of the cocktail party graph
• Graph theory
• The difference between consecutive primes. II

Cited in

(2)

• An overview of graph covering and partitioning
• Short proofs of some extremal results

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

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