Abstract

The skewness of a graph G is the minimum number of edges in G whose deletion results in a planar graph. We determine the skewness (i) of the Cartesian product of G with path and cycle and (ii) of the join product of G with isolated vertices. Moreover we also classify those that are π-skew from these classes of graphs.