Resolvable Mendelsohn designs with block size 4

DOI10.1007/BF02112298zbMath0725.05012MaRDI QIDQ2277268

Xuebin Zhang, Frank E. Bennett

Publication date: 1990

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137376

zbMATH Keywords

Mendelsohn designresolvable designperfect cyclic design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The existence of \(( \nu,6, \lambda\) )-perfect Mendelsohn designs with \(\lambda > 1\) ⋮ RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Classification of whist tournaments with up to 12 players ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles ⋮ The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments ⋮ Almost resolvable perfect Mendelsohn designs with block size five ⋮ On the directed Oberwolfach Problem with equal cycle lengths: the odd case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized complete mappings, neofields, sequenceable groups and block designs. II
• Resolvable perfect cyclic designs
• On the existence of frames
• Balanced incomplete block designs and related designs
• Perfect cyclic designs
• Resolvable decomposition of \(K^*_n\)
• Almost resolvable decomposition of K//n*

This page was built for publication: Resolvable Mendelsohn designs with block size 4