Graph $G$ becomes planar when any vertex is removed. Prove that its vertices can be properly colored with 5 colors. (Using the four-color theorem without proof is not allowed!) Proposed by D. Karpov