Definition: If a graph can be drawn on a plane so that its edges do not intersect (except at nodes), it is called a plane graph.

As shown in the following figure, figure 1 is k3,3, and figure 2 is the graph with the least intersection of edges in figure 1, but the intersection of edges can never be avoided, so k3,3 is a non-planar graph.