The graph with minimum no. of edges which is not Planar is K 3,3 and minimum vertices is K5. These are Kuratowski's Two graphs. They are non-planar because you can't draw them without vertices getting intersected. read more
The graph with minimum no. of edges which is not Planar is K 3,3 and minimum vertices is K5. These are Kuratowski's Two graphs. They are non-planar because you can't draw them without vertices getting intersected. read more
The graphs $$K_5$$ and $$K_{3,3}$$ are two of the most important graphs within the subject of planarity in graph theory. Kuratowski's theorem tells us that, if we can find a subgraph in any graph that is homeomorphic to $$K_5$$ or $$K_{3,3}$$, then the graph is not planar, meaning it's not possible for the edges to be redrawn such that they are none overlapping. read more