Matching divisible designs with block size four
type: Item
instance of: scholarly article
title: Matching divisible designs with block size four
zbMATH Open document ID: 1326.05018
author: Tao Feng
author: Alan C. H. Ling
author: Peter Dukes
published in: Discrete Mathematics
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6517684
zbMATH Keywords: group divisible design
zbMATH Keywords: graph factorization
zbMATH Keywords: edge-decomposition
MaRDI profile type: Publication
full work available at URL: j.disc.2015.10.011
OpenAlex ID: W2163735025
cites work: Q4488562
cites work: Edge-decompositions of graphs with high minimum degree
cites work: The existence of HGDDs with block size four and its application to double frames
cites work: 1-factorizing regular graphs of high degree - an improved bound
cites work: Graph divisible designs and packing constructions
cites work: Group divisible covering designs with block size 4: A type of covering array with row limit
cites work: Q3424715
cites work: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
cites work: Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
cites work: Combinatorial Designs
cites work: Existence of holey 3-GDDs of type \((u,g^t w^1)\)
cites work: Q4071247
cites work: Existence of frame SOLS of type \(a^n b^1\)
DOI: 10.1016/J.DISC.2015.10.011
description: scientific article; zbMATH DE number 6517684