Can somebody, please, explain how to prove this theorem:
If every vertex of a planar graph has an even degree, it’s 2-colourable.
I understand that we can make a dual graph out of original. The number of vertices will be the same as number of faces in the original graph. The number of edges will be the same as in the original graph. But what should I do next to prove the theorem?