Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles (Q1207298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles |
scientific article; zbMATH DE number 149479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles |
scientific article; zbMATH DE number 149479 |
Statements
Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles (English)
0 references
1 April 1993
0 references
This paper deals with decompositions of complete digraphs into a spanning set of factors, each of which is a vertex-disjoint union of isomorphic oriented 4-cycles. Necessary and sufficient conditions are given for the existence of such decompositions for three orientations of the 4-cycle (those for the other orientation have already appeared in the literature). The authors also consider decompositions in which each factor spans all but one of the vertices of the complete digraph, and give necessary and sufficient conditions for the three orientations of the 4-cycle for which the problem was unsolved.
0 references
decompositions
0 references
complete digraphs
0 references
factors
0 references
oriented 4-cycles
0 references
orientation
0 references
0.8709563612937927
0 references
0.8584808111190796
0 references
