An edge-n-coloring of a uniform tiling {\cal T} is uniform if for any two vertices of {\cal T} there is a symmetry of {\cal T} that preserves the colors of the edges and maps one vertex onto the other. This paper gives a method based on group theory and color symmetry theory to arrive at uniform edge-n-colorings of uniform tilings. The method is applied to give a complete enumeration of uniform edge-n-colorings of the uniform tilings of the Euclidean plane, for which the results point to a total of 114 colorings, n = 1, 2, 3, 4, 5. Examples of uniform edge-n-colorings of tilings in the hyperbolic plane and two-dimensional sphere are also presented.
Keyphrases