A Conjecture of Borodin and a Coloring of Grünbaum

In 1976 Borodin conjectured that every planar graph has a 5-coloring such that the union of every k color classes with 1 ⩽ k ⩽ 4 induces a k-degenerate graph. We prove the existence of such a coloring using 18 colors.