The Open UniversitySkip to content

Cuboctahedron designs

Grannell, Mike; Griggs, Terry and Holroyd, Fred (2000). Cuboctahedron designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 35, pp. 185–191.

Google Scholar: Look up in Google Scholar


We prove that the complete graph $K_v$ can be decomposed into cuboctahedra if and only if $v \equiv$ 1 or 33 (mod 48).

Item Type: Journal Article
ISSN: 0835-3026
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 22790
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:41
Last Modified: 15 Jan 2016 14:49
Share this page:

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340