Question: Given a planar graph P = (V, E), we have Euler's formula: V+ |F| - E| = 2, where F is the set of faces

Given a planar graph P = (V, E), we have Euler's formula: V+ |F| - E| = 2, where F is the set of faces of P and E is the set of edges of P. Let |V] = n, where V is the set of vertices of P. Prove that F is at most 2n
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
