Matching divisible designs with block size four

DOI10.1016/J.DISC.2015.10.011zbMath1326.05018OpenAlexW2163735025MaRDI QIDQ898140

Alan C. H. Ling, Tao Feng, Peter J. Dukes

Publication date: 8 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.10.011

zbMATH Keywords

group divisible designgraph factorizationedge-decomposition

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Group divisible packings and coverings with any minimum leave and minimum excess ⋮ Leaves for packings with block size four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
• Graph divisible designs and packing constructions
• The existence of HGDDs with block size four and its application to double frames
• 1-factorizing regular graphs of high degree - an improved bound
• Existence of holey 3-GDDs of type \((u,g^t w^1)\)
• Existence of frame SOLS of type \(a^n b^1\)
• Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Combinatorial Designs
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: Matching divisible designs with block size four