A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face α the maximal color appears exactly once on the vertices of α. If the coloring is required to be proper, then the upper bound for the minimal number of colors required for such a coloring is set to 5. Fabrici and Göring [5] even con- jectured that 4 colors always suffice. Confi the conjecture would hence give a considerable strengthening of the Four Color Theorem. In this paper, we prove that the conjecture holds for subcubic plane graphs, outerplane graphs and plane quadrangulations. Additionally, we consider the facial edge-coloring analogue of the aforementioned coloring and prove that every 2-connected plane graph admits such a coloring with at most 4 colors.