Q:

how to calculate number of bounded faces in a graph?

Let G be a simple undirected planar graph on 10 vertices with 15 edges.If G is a connected graph,then the number of bounded faces in any embedding of G on the plane is equal to?
How to solve these types of questions?

A:

This can be computed according to Euler's formula and you can find the proof here Euler characteristic

