Uniform partitions of 3-space, their relatives and embedding (Q1582487)

A convex \(3\)-polytope is called uniform if its facets are regular polygons and its group of (affine) automorphisms acts transitively on the set of vertices. A uniform partition of the Euclidean \(3\)-space is a (necessarily infinite) polytopal decomposition into uniform polytopes with a vertex transitive automorphism group. \textit{B. Grünbaum} [Geombinatorics 4, No. 2, 49-56 (1994; Zbl 0844.52022)] classified the 28~types. The paper under review contains tables on the combinatorics of these and related partitions. The main focus is on the embeddability of the graphs of the partitions.