The thickness of the Kronecker product of graphs

Abstract

The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker product G × H of two graphs G and H. We also give the exact thickness numbers for the Kronecker product graphs2010 Mathematics Subject Classification. 05C10.