Problem 2 (2pts). Let g 2 2 be an integer and let G be a connected...

Transcribed Image Text:

Problem 2 (2pts). Let g 2 2 be an integer and let G be a connected plane graph on n vertices wherein every face is bounded by a cycle of G. Prove that if G has no cycles of length g or smaller, then |E(G)| s g+1 (n-2). - 1 Problem 2 (2pts). Let g 2 2 be an integer and let G be a connected plane graph on n vertices wherein every face is bounded by a cycle of G. Prove that if G has no cycles of length g or smaller, then |E(G)| s g+1 (n-2). - 1

Answer rating: 100% (QA)

Solution be connected plane goroph on let e the numben of edges and b... View the full answer