No it hasn't. What IS true, is that if the coloring number is N,
then there's always a map with just N faces that can only be colored
by making them all different.
But essentially nothing is known about which maps can be made with
planar faces, whether they're of this type or not. A little bit more
is known about the dual problem, namely that for
genus 0 1 2 3 4
the minimal number of vertices for an embedded polyhedron is
4 7 8 10 11,
and the big problem here is whether the next entry is 12. These are
lower bounds for the minimal face numbers, but as far as I know, they
haven't yet been shown to be achieved for genus 2 or more.
John Conway