Decomposing the complete graph into dodecahedra

DOI10.1016/J.JSPI.2011.11.001zbMATH Open1239.05144OpenAlexW2007438205MaRDI QIDQ413339FDOQ413339

P. Adams, T. S. Griggs, Anthony D. Forbes, Darryn 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)

Cites Work

• A survey on the existence ofG-Designs
• Balanced incomplete block designs and related designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strongly graceful graphs
• Decompositions of complete graphs into isomorphic cubes
• Cuboctahedron designs
• Truncated tetrahedron, octahedron and cube designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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\)
• Group divisible designs with block-size four
• The existence of uniform 5-GDDs

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)