On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P