A (simple) graph is said to be maximal planar if it is planar and adding one more edge loses planarity. In other words, the graph is planar and every face is a triangle. Tait gave a one-one correspondence between 4-colourings of maximal planar graphs and 3-edge colourings of their dual graphs. That is, given a 4-vertex colouring of a maximal planar graph $G$, one can produce a 3-edge colouring of the dual graph $G^*$ of $G$, and vice versa. The schemes to produce one from the other are elegant.
Similarly, there are schemes to produce (vertex) colouring of $G^*$ from colouring of $G$.
Is there a known scheme to produce a colouring of a maximal planar graph from a colouring of its dual graph?
(In other words, given a face colouring of a maximal planar graph, can we produce a vertex colouring?)
Clarification: I am not asking for a 4-colouring of the maximal planar graph. From a 4-colouring (or 5-coluoring) of its dual graph, is it possible to produce a colouring of the maximal planar graph (may be with 5 or even 6 colours; but it should be a colouring scheme that actually use the colouring of the dual graph).