 Euler formula for a connected planar graph (source code)

by Codex (@codex,  0)

= Euler formula for a connected planar graph
{c}

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

 Back to article page