Graphs in this paper are without loops and multiple edges. Every planar graph is four colorable by the Four Color Theorem [2, 24]. The efforts to solve the Four Color Problem had a great effect on the development of graph theory, and FCT is one of the mos important theorems of the field. The crossing number of a graph G, denoted cr(G), is the minimum number of edge crossings in a drawing of G in the plane. It is a natural relaxation of planarity, see for a survey...