github / keybase / email
index

Euler characteristic of a planar graph

Euler's formula states than in a finite, connected planar graph, |V|-|E|+|F|=2 with |V| the number of vertices in the graph, |E| the number of edges, |F| the number of faces and 2 the Euler characteristic.

Euler characteristic on Wikipedia.