On the skewness of the join of graphs

The skewness   of a graph GG is the minimum number of edges in GG whose deletion results in a planar graph. We prove some results concerning the skewness for the join of two graphs. We then use these results to determine completely the skewness of complete kk-partite graphs for k=2,3,4k=2,3,4.