Matching divisible designs with block size four
From MaRDI portal
Publication:898140
DOI10.1016/J.DISC.2015.10.011zbMATH Open1326.05018OpenAlexW2163735025MaRDI QIDQ898140FDOQ898140
Authors: Tao Feng, Alan C. H. Ling, Peter 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
Recommendations
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Combinatorial Designs
- Edge-decompositions of graphs with high minimum degree
- Existence of frame SOLS of type \(a^n b^1\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The existence of HGDDs with block size four and its application to double frames
- Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
- 1-factorizing regular graphs of high degree - an improved bound
- Existence of holey 3-GDDs of type \((u,g^t w^1)\)
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
- Group divisible covering designs with block size 4: A type of covering array with row limit
- Graph divisible designs and packing constructions
Cited In (4)
This page was built for publication: Matching divisible designs with block size four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898140)
