Almost resolvable decomposition of K//n*
type: Item
instance of: scholarly article
title: Almost resolvable decomposition of K//n*
zbMATH Open document ID: 0509.05042
DOI: 10.1016/0095-8956(81)90067-8
published in: Journal of Combinatorial Theory. Series B
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3803478
zbMATH Keywords: complete symmetric directed graph
zbMATH Keywords: resolvable decomposition
zbMATH Keywords: transitive tournament
zbMATH Keywords: directed cycle
author: Frank E. Bennett
author: D. Sotteau
MaRDI profile type: Publication
full work available at URL: 0095-8956(81)90067-8
OpenAlex ID: W2053573731
cites work: Resolvable perfect cyclic designs
cites work: Resolvable decomposition of \(K^*_n\)
cites work: Optimal packings of \(K_4\)'s into a \(K_n\)
cites work: Q3941422
cites work: Balanced incomplete block designs and related designs
cites work: On resolvable balanced incomplete block designs
description: scientific article; zbMATH DE number 3803478