Perfect precise colorings of plane semiregular tilings

Abstract

A coloring of a planar semiregular tiling T is an assignment of a unique color to each tile of T. If G is the symmetry group of T, we say that the coloring is perfect if every element of G induces a permutation on the finite set of colors. If T is k-valent, then a coloring of T with k colors is said to be precise if no two tiles of T sharing the same vertex have the same color. In this work, we obtain perfect precise colorings of some families of k-valent semiregular tilings in the plane, where k≤ 6.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…