Round-dance neighbour designs from terraces (Q1810630)
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: Round-dance neighbour designs from terraces |
scientific article; zbMATH DE number 1924756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Round-dance neighbour designs from terraces |
scientific article; zbMATH DE number 1924756 |
Statements
Round-dance neighbour designs from terraces (English)
0 references
9 June 2003
0 references
A round-dance neighbour design is a partition of the complete graph on an odd number of vertices into Hamilton cycles. Such Hamiltonian decompositions are generated in this paper from terraces (sequencings) and an enumeration of solutions is given for small groups.
0 references
2-sequencings
0 references
balanced-circuit designs
0 references
directed terraces
0 references
Hamiltonian decomposition
0 references
Lucas-Walecki construction
0 references
Owens terrace
0 references
Ramsgate Sands problem
0 references
Rees neighbour designs
0 references
row-complete Latin squares
0 references
symmetric sequencings
0 references
triangular-number terraces
0 references
Tuscan squares
0 references
0 references
