Resolvable balanced bipartite designs

DOI10.1016/0012-365X(76)90064-9zbMath0325.05008OpenAlexW2069275583MaRDI QIDQ1225053

Charlotte Huang

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0012-365x(76)90064-9

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30)

Related Items (8)

Large set of P₃‐decompositions ⋮ Star factorizations of graph products ⋮ Block colourings of star systems ⋮ Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ A classification of certain graphs with minimal imperfection properties ⋮ A survey on the existence ofG-Designs ⋮ \(G\)-designs and related designs ⋮ Combinatorial designs related to the strong perfect graph conjecture

Cites Work

• Balanced bipartite weighing designs
• Parallel concepts in graph theory
• On the existence of balanced bipartite designs. II
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Unnamed Item
• Unnamed Item

This page was built for publication: Resolvable balanced bipartite designs