A family of resolvable regular graph designs

DOI10.1016/0012-365X(95)00052-XzbMath0855.62062OpenAlexW2041753308MaRDI QIDQ1923524

Walter D. Wallis, Gordon F. Royle, Donald L. Kreher

Publication date: 2 February 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00052-x

zbMATH Keywords

block size 4resolvable regular graph designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Statistical block designs (62K10)

Related Items (2)

Constructions for regular-graph semi-Latin rectangles with block size two ⋮ Constructing difference families through an optimization approach: Six new BIBDs

Cites Work

• On the optimality of block designs
• Nonexistence of a regular graph design with \(v=17\) and \(k=6\)
• Scheduling a Bridge Club (A Case Study in Discrete Optimization)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A family of resolvable regular graph designs