Leaves for packings with block size four
From MaRDI portal
Publication:5000309
zbMath1468.05225arXiv1905.12151MaRDI QIDQ5000309
Tao Feng, Peter J. Dukes, Yan Xun Chang
Publication date: 12 July 2021
Full work available at URL: https://arxiv.org/abs/1905.12151
Sampling theory, sample surveys (62D05) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group divisible designs with block size four and group type \(g^um^1\)
- 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
- Matching divisible designs with block size four
- The existence of HGDDs with block size four and its application to double frames
- Group divisible designs with block-size four
- Packing graphs: The packing problem solved
- HGDDs with block size four.
- A symmetric function generalization of the chromatic polynomial of a graph
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
- Covering and packing for pairs
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Group divisible designs with block size 4 and type
- Group divisible designs with block size four and type —II
- Graph-Theoretic Concepts in Computer Science
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Leaves for packings with block size four