Decomposing the complete graph into dodecahedra

DOI10.1016/J.JSPI.2011.11.001zbMath1239.05144OpenAlexW2007438205MaRDI QIDQ413339

Terry S. Griggs, Peter J. Adams, Anthony D. Forbes, Darryn E. Bryant

Publication date: 4 May 2012

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2011.11.001

zbMATH Keywords

graph decompositiondodecahedron

Mathematics Subject Classification ID

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

Related Items (2)

Archimedean graph designs ⋮ Archimedean graph designs. II.

Cites Work

• Strongly graceful graphs
• Decompositions of complete graphs into isomorphic cubes
• Balanced incomplete block designs and related designs
• Group divisible designs with block-size four
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• A survey on the existence ofG-Designs
• The existence of uniform 5-GDDs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing the complete graph into dodecahedra