On the number of faces of dual graph

31 Views Asked by At

Let $G$ be a planar, connected graph with $n$ vertices, $m$ edges and $\Phi$ sides. Prove that in his dual graph $G^\ast$ the number of sides is $\Phi(G^\ast)=n$. Sorry for my English, thanks!