Decomposing the complete graph into dodecahedra

DOI10.1016/J.JSPI.2011.11.001MaRDI QIDQ413339zbMATH OpenOpenAlexFDO

Authors T. S. Griggs, P. Adams, Darryn Bryant, Anthony D. Forbes

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)

Cites work

• scientific article; zbMATH DE number 5902393 (Why is no real title available?)
• scientific article; zbMATH DE number 5130671 (Why is no real title available?)
• scientific article; zbMATH DE number 140058 (Why is no real title available?)
• scientific article; zbMATH DE number 637284 (Why is no real title available?)
• scientific article; zbMATH DE number 637292 (Why is no real title available?)
• scientific article; zbMATH DE number 890666 (Why is no real title available?)
• A survey on the existence ofG-Designs
• Balanced incomplete block designs and related designs
• Cuboctahedron designs
• Decompositions of complete graphs into isomorphic cubes
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• Group divisible designs with block-size four
• On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
• Strongly graceful graphs
• The existence of uniform 5-GDDs
• Truncated tetrahedron, octahedron and cube designs

Cited in

(4)

• scientific article; zbMATH DE number 404530 (Why is no real title available?)
• scientific article; zbMATH DE number 890666 (Why is no real title available?)
• Archimedean graph designs
• Archimedean graph designs. II.

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

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