Generalized group divisible covering designs

DOI10.1007/S10623-026-01863-5MaRDI QIDQ7262068zbMATH OpenFDO

Authors Jialu Wang, Lijun Ma, Lidong Wang, Zi Hong Tian

Publication date 10 June 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01863-5

zbMATH Keywords

1-factorizations of complete multipartite graphsgeneralized covering designsgeneralized group divisible covering designsgroup divisible covering designsmixed covering arrays

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Cites work

• A generalisation of \(t\)-designs
• A generalization of group divisible t t‐designs
• Balanced incomplete block designs and related designs
• Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
• Covering arrays with mixed alphabet sizes
• Covering graphs: The covering problem solved
• Generalized covering designs and clique coverings
• Generalized packing designs
• Graph theory with applications
• Group divisible covering designs with block size four
• scientific article; zbMATH DE number 1229701 (Why is no real title available?)
• scientific article; zbMATH DE number 1229732 (Why is no real title available?)
• scientific article; zbMATH DE number 1286223 (Why is no real title available?)
• scientific article; zbMATH DE number 3103352 (Why is no real title available?)
• On group divisible covering designs
• Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
• Orthogonal one-factorizations of complete multipartite graphs
• The CRC handbook of combinatorial designs

This page was built for publication: Generalized group divisible covering designs

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