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 graphs K n × K 2 , K m , n × K 2 and K n , n , n × K 2 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
