Decomposition of complete graphs into 5‐cubes

DOI10.1002/JCD.20066MaRDI QIDQ5469154zbMATH OpenOpenAlexFDO

Authors Darryn Bryant, Barbara Maenhaut, C. Vanden Eynden, S. I. El-Zanati

Publication date 16 May 2006

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20066

zbMATH Keywords

cube decompositionKotzig conjecture

Mathematics Subject Classification ID

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

Recommendations

• Decomposing complete graphs into cubes
• scientific article; zbMATH DE number 637284
• Star decompositions of cubes
• scientific article; zbMATH DE number 1228806
• scientific article; zbMATH DE number 786149

Cites work

• Transversals and matroid partition

Cited in

(7)

• Further decompositions of complete tripartite graphs into 5-cycles
• A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
• Graph decompositions into generalized cubes
• Q₄-factorization of K_n and K_x(m)
• A survey on the existence ofG-Designs
• scientific article; zbMATH DE number 5778712 (Why is no real title available?)
• Q₅‐factorization of λK_n

This page was built for publication: Decomposition of complete graphs into 5‐cubes

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