On the existence of resolvable K4 − e designs

DOI10.1002/JCD.20155MaRDI QIDQ5434635zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Resolvable G-designs of order v and index {\lambda}
• scientific article; zbMATH DE number 6172658
• scientific article; zbMATH DE number 5914966
• The spectrum of {\(\alpha\)}-resolvable {\(\lambda\)}-fold \((K_4-e)\)-designs
• Completing the spectrum for three designs related to the graph \(K_4 - e\)

Cites work

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

Cited in

(9)

• On the existence of maximum resolvable (\(K_{4} - e\))-packings
• scientific article; zbMATH DE number 6172658 (Why is no real title available?)
• Completing the spectrum for three designs related to the graph \(K_4 - e\)
• The fine triangle intersection problem for \((K_4 - e)\)-designs
• Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
• scientific article; zbMATH DE number 5914966 (Why is no real title available?)
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• On the existence of resolvable \((K_{3} + e)\)-group divisible designs
• Scheduling to reduce close contacts: resolvable grid graph decomposition and packing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434635)