Clique partitions of the cocktail party graph
From MaRDI portal
Publication:1076691
DOI10.1016/0012-365X(86)90173-1zbMath0594.05039OpenAlexW1970804184MaRDI QIDQ1076691
Sean McGuinness, David A. Gregory, Walter D. Wallis
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90173-1
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (11)
Pairwise balanced designs and sigma clique partitions ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Clique partitions and clique coverings ⋮ Problems and results on 1-cross-intersecting set pair systems ⋮ Graphs with sparsity order at most two: the complex case ⋮ Edge clique covering sum of graphs ⋮ Biclique cover and local clique cover of graphs ⋮ Clique partitions of complements of forests and bounded degree graphs ⋮ Short Proofs of Some Extremal Results ⋮ Eigenvalues and clique partitions of graphs ⋮ On the number of distinct minimal clique partitions and clique covers of a line graph
Cites Work
- A new proof of a theorem of Graham and Pollak
- Subsets of a finite set that intersect each other in at most one element
- On the decomposition ofkn into complete bipartite graphs
- Variants of Cyclic Difference Sets
- On the Addressing Problem for Loop Switching
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- On the difference between consecutive primes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clique partitions of the cocktail party graph