Displaying similar documents to “Infinitely many hypermaps of a given type and genus.”

On rainbowness of semiregular polyhedra

Stanislav Jendroľ, Štefan Schrötter (2008)

Czechoslovak Mathematical Journal

Similarity:

We introduce the rainbowness of a polyhedron as the minimum number k such that any colouring of vertices of the polyhedron using at least k colours involves a face all vertices of which have different colours. We determine the rainbowness of Platonic solids, prisms, antiprisms and ten Archimedean solids. For the remaining three Archimedean solids this parameter is estimated.