Perfect precise colourings of \(\{3,n\}\) with \(n\) colours (Q1021286)

The regular tiling \(\{3,n\}\), in which \(n\) triangular tiles meet at each vertex, exists on the sphere, the Euclidean plane, or the hyperbolic plane when \(n< 6\), \(n=6\), or \(n> 6\), respectively. A colouring of such a tiling with \(n\) colours is called precise if one tile of each colour occurs at each vertex. If every direct symmetry of the tiling permutes the colours, the colouring is called chirally perfect. In the paper under review a method of enumerating perfect precise colourings of \(\{3,n\}\) with \(n\) colours is given. The investigation is based on sets of tiles called trees.