Archimedean graph designs. II.

DOI10.1016/J.DISC.2017.02.016zbMath1361.05079OpenAlexW2010314252MaRDI QIDQ526249

Terry S. Griggs, Tamsin J. Forbes, Anthony D. Forbes

Publication date: 10 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.02.016

zbMATH Keywords

graph designgraph decompositionArchimedean graph

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Archimedean graph designs
• Decomposing the complete graph into dodecahedra
• Strongly graceful graphs
• Decompositions of complete graphs into isomorphic cubes
• Balanced incomplete block designs and related designs
• Group divisible designs with block-size four
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• A survey on the existence ofG-Designs
• Two new direct product‐type constructions for resolvable group‐divisible designs

This page was built for publication: Archimedean graph designs. II.