Clique partitions of the cocktail party graph
- 31 May 1986
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 59 (3) , 267-273
- https://doi.org/10.1016/0012-365x(86)90173-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A new proof of a theorem of Graham and PollakDiscrete Mathematics, 1984
- On the decomposition of kn into complete bipartite graphsJournal of Graph Theory, 1982
- On the difference between consecutive primesInventiones Mathematicae, 1979
- Contentment in graph theory: Covering graphs with cliquesIndagationes Mathematicae, 1977
- Subsets of a finite set that intersect each other in at most one elementJournal of Combinatorial Theory, Series A, 1974
- On embedding graphs in squashed cubesPublished by Springer Nature ,1972
- On the Addressing Problem for Loop SwitchingBell System Technical Journal, 1971
- Combinatorial Properties of Group Divisible Incomplete Block DesignsThe Annals of Mathematical Statistics, 1952