Clique partitions of complements of forests and bounded degree graphs

DOI10.1016/J.DISC.2007.04.041zbMATH Open1158.05032OpenAlexW1998568320MaRDI QIDQ952663FDOQ952663

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

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

zbMATH Keywords

probabilistic methodSteiner systemsclique partitions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The difference between consecutive primes. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clique partitions of the cocktail party graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)