Archimedean graph designs. II.
From MaRDI portal
Publication:526249
Recommendations
- Archimedean graph designs
- Configurations and graphs. II
- Hadamard graphs. II
- Iterated arc graphs.
- Archimedean tiling graphs with Gallai's property.
- Graphs and degree sequences. II
- Hadamard graphs. I
- scientific article; zbMATH DE number 2188475
- scientific article; zbMATH DE number 2165838
- scientific article; zbMATH DE number 3347145
Cites work
- scientific article; zbMATH DE number 5902393 (Why is no real title available?)
- scientific article; zbMATH DE number 140058 (Why is no real title available?)
- scientific article; zbMATH DE number 637284 (Why is no real title available?)
- scientific article; zbMATH DE number 637292 (Why is no real title available?)
- scientific article; zbMATH DE number 890666 (Why is no real title available?)
- scientific article; zbMATH DE number 2229033 (Why is no real title available?)
- A survey on the existence ofG-Designs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Archimedean graph designs
- Balanced incomplete block designs and related designs
- Cuboctahedron designs
- Decomposing the complete graph into dodecahedra
- Decompositions of complete graphs into isomorphic cubes
- Group divisible designs with block-size four
- Icosahedron designs
- Strongly graceful graphs
- The CRC handbook of combinatorial designs
- Truncated tetrahedron, octahedron and cube designs
- Two new direct product‐type constructions for resolvable group‐divisible designs
Cited in
(5)
This page was built for publication: Archimedean graph designs. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526249)