Coloring Uniform Honeycombs
In this paper, we discuss a method of arriving at colored three-dimensional uniform honeycombs. In particular, we present the construction of perfect and semi-perfect colorings of the truncated and bitruncated cubic honeycombs. If G is the symmetry group of an uncolored honeycomb, a coloring of the honeycomb is perfect if the group H consisting of elements that permute the colors of the given coloring is G. If H is such that [G:H] = 2, we say that the coloring of the honeycomb is semi-perfect.
Laigo, G. R., de las Penas, M. L. A. N., & Felix, P. R. P. (2009). Coloring Uniform Honeycombs. In Kaplan, C. S., & Sarhangi, R. (Eds.), Proceedings of Bridges 2009: Mathematics, Music, Art, Architecture, Culture (pp. 131-138). Tarquin Publications.