Let $G$ be a planar minimal 5-chromatic graph. That is, any of its proper subgraphs has chromatic number at most 4. I need to prove that its minimum degree is at least 5. I want to prove by contradiction, first by assuming that there is a vertex of degree 4. But I couldn't find any contradiction. Can anyone offer any ideas?