On resolvable multipartite G-designs

DOI10.1007/S00373-004-0563-2zbMATH Open1054.05083OpenAlexW1964623105MaRDI QIDQ704833FDOQ704833

Authors: A. 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

Recommendations

• On resolvable multipartite \(G\)-designs. II
• \(\widehat C_k\)-factorization of symmetric complete bipartite and tripartite multi-digraphs
• \(G\)-designs and related designs
• scientific article; zbMATH DE number 3959482
• Cycle-factorization of symmetric complete multipartite digraphs

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)

Cited In (2)

• On resolvable multipartite \(G\)-designs. II
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs

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

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