On the existence of resolvable K4 − e designs

DOI10.1002/jcd.20155zbMath1128.05002OpenAlexW2070303405MaRDI QIDQ5434635

Gennian Ge, Alan C. H. Ling

Publication date: 7 January 2008

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20155

zbMATH Keywords

resolvable(\(K_{4}-e\))-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (6)

On the existence of resolvable \((K_{3} + e)\)-group divisible designs ⋮ Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) ⋮ On the existence of maximum resolvable (\(K_{4} - e\))-packings ⋮ Completing the spectrum for three designs related to the graph \(K_4 - e\) ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

Cites Work

• Further results on \((v,\{5,w^*\},1)\)-PBDs

This page was built for publication: On the existence of resolvable K₄ − e designs