Journal of Geometry, vol.89, no.1-2, pp.179-185, 2008 (SCI-Expanded)
We consider chirally perfect colourings of the regular triangular tiling {3, n} with n + 1 colours, in such a way that n different colours occurs at each vertex and give an algorithm to find colour permutations at each vertices. © 2008 Birkhaueser.