retagged by
1,108 views
1 votes
1 votes

Is there any subgraph homoemorphic to K5 present in G1 for the following question?

 Which one of the following graphs is NOT planar?

image image image image 
(A) G1   (B) G2   (C) G3   (D) G4

In this question planar drawings( no 2 edges intersect) for G2, G3 and G4 exists, thats why answer should be G1

But I couldn't find any subgraph homoemorphic to K5 in G1 as a graph is non planar iff it contains a subgraph homoemorphic to K5 or K3,3...

retagged by

2 Answers

0 votes
0 votes
Though by simple structure modification you can easily identify that G2, G3, G4 are not planer so now the only choice left is G1.

 

If you notice then G1 is isomorphic to K3,3 and hence it is not planer.

Related questions

0 votes
0 votes
1 answer
1
Dhiraj_777 asked May 4, 2023
516 views
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
1 votes
1 votes
0 answers
2
Shamim Ahmed asked Dec 21, 2018
818 views
In a connected 3 regular graph, every planar region is bounded by exactly 5 edges, then count no of edges?
0 votes
0 votes
1 answer
3
Na462 asked Dec 2, 2018
3,532 views
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
0 votes
0 votes
1 answer
4
srestha asked Oct 22, 2018
1,664 views
Can minimum degree of a planar graph be $5$? Give some example