Title of article :
Decomposing the complete graph into dodecahedra
Author/Authors :
Adams، نويسنده , , P. and Bryant، نويسنده , , D.E. and Forbes، نويسنده , , A.D. and Griggs، نويسنده , , T.S.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
Abstract :
We prove that the complete graph Kv can be decomposed into dodecahedra if and only if v ≡ 1, 16, 25 or 40 (mod 60), v ≠ 16 .
Keywords :
Graph decomposition , dodecahedron
Journal title :
Journal of Statistical Planning and Inference
Journal title :
Journal of Statistical Planning and Inference
