Rainbowness of plane graphs

The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G using at least k colours involves a face all vertices of which receive distinct colours. We give a survey on recent results concerning ranbowness of plane graphs.