Education, Mathematics, Math, Science, Technology.
holds for all graphs with |E|=n. Consider a planar graph graph G=(V, E), with faces F, such that |E|=n+1. There are 2 cases: Case 1: G=(V, E) is a tree. All trees have |V| = |E| + 1 (this fact and the proof of this could be expanded on if you haven’t worked with trees before). Additionally, since