Let G be a simple undirected planar graph on 10 vertices with l5 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

Keep practicing — related questions

• Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the pl...
• If G is a connected planar graph with e edges,v vertices,and f faces then which is true?
• If G is a connected planar graph with e edges,v vertices,and f faces then which is true?
• Let G be the non-planar graph with the minimum possible number of edges. Then G has
• Let G be a simple graph with 20 vertices and 100 edges. If the size of the minimum vertex cover of G is 8, ...
• According to Kuratowski's Theorem a graph G is planar if and only if G does not contain a subgraph homeomor...
• Which of the following statements is true for every planar graph on n vertices?
• Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?