Balanced directed cycle designs based on groups

DOI10.1016/0012-365X(91)90287-CzbMath0760.05016DBLPjournals/dm/Praeger91WikidataQ56988365 ScholiaQ56988365MaRDI QIDQ1182947

Cheryl E. Praeger

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

directed multigraphdirected cyclesbalanced directed cycle design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30)

Related Items (1)

RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariants and constructions of Mendelsohn designs
• Mendelsohn designs admitting the affine group
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of the complete directed graph into k-circuits
• On the construction of handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs

This page was built for publication: Balanced directed cycle designs based on groups