Decomposition of complete graphs into 5‐cubes

DOI10.1002/jcd.20066zbMath1087.05046OpenAlexW1974686139MaRDI QIDQ5469154

Barbara M. Maenhaut, Darryn E. Bryant, Charles Vanden Eynden, Saad 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

Kotzig conjecturecube decomposition

Mathematics Subject Classification ID

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

Related Items (3)

Q₅‐factorization of λK_n ⋮ A survey on the existence ofG-Designs ⋮ $Q_4$-Factorization of $\lambda K_n$ and $\lambda K_x(m)$

Cites Work

• Transversals and matroid partition

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