## You are here

HomeEuler's polyhedron theorem

## Primary tabs

# Euler’s polyhedron theorem

###### Theorem 1 ().

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

$n-m+f=2.$ |

Keywords:

graph, vertex, edge, face, vertices

Related:

Graph, GraphTheory, PoincareFormula, Polytope

Synonym:

Euler's formula

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

05C99*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections