Clique partitions and clique coverings

DOI10.1016/0012-365X(88)90197-5zbMath0679.05040MaRDI QIDQ1124604

Edward T. Ordman, Ralph J. Faudree

Publication date: 1988

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

zbMATH Keywords

boundsasymptotic resultsclique covering numberclique partition 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 (10)

Spectral radius and clique partitions of graphs ⋮ Pairwise balanced designs and sigma clique partitions ⋮ An overview of graph covering and partitioning ⋮ Clique Partitions of Chordal Graphs ⋮ A note on abelian partitionable groups ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Clique partitions of distance multigraphs ⋮ Eigenvalues and clique partitions of graphs ⋮ The enumeration of spanning tree of weighted graphs ⋮ Graph partition into small cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique partitions of the cocktail party graph
• On a clique covering problem of Orlin
• Asymptotic values of clique partition numbers
• The Representation of a Graph by Set Intersections

This page was built for publication: Clique partitions and clique coverings