Clique partitions of the cocktail party graph
From MaRDI portal
Publication:1076691
DOI10.1016/0012-365X(86)90173-1zbMath0594.05039MaRDI QIDQ1076691
Sean McGuinness, David A. Gregory, Walter D. Wallis
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Clique partitions of complements of forests and bounded degree graphs, Clique partitions and clique coverings, Subsets of a finite set that almost always intersect each other in \(\lambda\) elements, On the number of distinct minimal clique partitions and clique covers of a line graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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