Euler’s polyhedron theorem

Theorem 1

If a connected plane graph has $n$ vertices, $m$ edges, and $f$ faces, then

$$n-m+f=2.$$