Graph Theory 5: Polyhedra, Planar Graphs, & F-E+V=2

Euler’s Theorem for Polyhedra and Planar Graphs establishing a relationship between the number of faces, edges, and vertices. Includes a proof by mathematical induction on the number of vertices.