Archimedean graph designs

DOI10.1016/j.disc.2011.11.012zbMath1277.05114OpenAlexW4206694519MaRDI QIDQ385374

Anthony D. Forbes, Terry S. Griggs

Publication date: 2 December 2013

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

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

zbMATH Keywords

graph designgraph decompositionArchimedean graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Related Items (1)

Archimedean graph designs. II.

Cites Work

• Decomposing the complete graph into dodecahedra
• Strongly graceful graphs
• Decompositions of complete graphs into isomorphic cubes
• Balanced incomplete block designs and related designs
• A survey on the existence ofG-Designs
• Convex Polyhedra with Regular Faces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Archimedean graph designs