On resolvable multipartite \(G\)-designs

DOI10.1007/s00373-004-0563-2zbMath1054.05083OpenAlexW1964623105MaRDI QIDQ704833

Appu Muthusamy

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0563-2

zbMATH Keywords

Complete sysmmetric \(k\)-partite multi-digraphCycle-factorizationresolvable multipartie \(G\)-designWreath product of graphs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On resolvable multipartite \(G\)-designs. II

This page was built for publication: On resolvable multipartite \(G\)-designs