 Euler formula for a connected planar graph

For a connected planar graph with $n$ vertices, $e$ edges, and $f$ faces,Deleting a cycle edge preserves connectedness and decreases both $e$ and $f$ by one, reducing the formula to its immediate tree case.