Here we also need to prove that the given graph can't be colored with less than 4 colors.
As it consists cycle with odd vertices it requires at least 3 colors.
But if you try to color them with 3 colors it is not possible to color them with 3 colors.
More ever any planar graph can be colored with 4 colors (Four color theorem).