Euler’s formula for Planar Graph is one of the most important formula in Graph theory and it can be easily proved by Mathematical Induction. The main point in the proof is as we add an extra edge it can either lead to an increase in one face or increase in one vertex. They both get cancelled by the increase in the number of edge and the formula holds for all planar graphs.
Sumant's 1 page of Math 