Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Acta crystallographica. Section A, Foundations and advances
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
