Let be connected planar Graph with faces. Then: Proof Induction Corollary If is planar and , then . Proof WLOG is connected (by adding some edges) Then Now: so the result follows Corollary Suppose is planar and and there is no cycle of length 3. Then Proof