Kuratowski's theorem on Planar graphs

106 Views Asked by At

I've got an exercise that I've been battling for 5 hours to solve. There is a picture of the graph below. I am sure that I can't find a K5 as a minor since every vertex has 3 edges leaving. I tried so long to find a K3,3 minor and failed. What is the correct approach? I also strongly believe that it is not planar graph.

enter image description here

1

There are 1 best solutions below

2
On BEST ANSWER

Delete the edges $\{EG\}$ and $\{FH\}$. Then you can do the following:

enter image description here