Importance of k5 and k3,3 in graph theory

In this article we show that complete graph k5 and complete bipartite graph k3, 3 is very important in graph theory. Then we explain the rule of programming formulation of the thickness problem. The thickness of a graph G= (V, E) is the minimum number of planar sub graph into which the graph can be decomposed. Therefore, the thickness is one measure of the degree of non planarity of a graph. The thickness problem is NP-hard. The thickness problem has application in VLSI design. In this article we show that complete graph and complete bipartite graph is very important in graph theory. In particular complete graphs k5 and bipartite graphs k3,3 is very important in thickness and matroid problem.