Is graph Planar?

Question

Hello i have the following graph:

I'm trying to figure out if it's planar or not. I think it is not planar but i can't find a subgraph that is a subdivision of K3,3 or K5 , to use the kuratowski theorem.

p.s. i can only redraw the graph to show that it is planar or prove that its not planar with kuratowski theorem. NO other methods allowed.

Answer 1

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

Answer 2

Try $K_{3,3}$ with BHI as one of the sides.

Answer 3

Does the following regrouping help:

Yes it does! If the original graph were planar, you could collapse any two connected vertices into one and still the graph would remain planar. But this way you would get that the above grouped graph, which is $K_{3,3}$, is planar: a contradiction.