The thickness of the Kronecker product of graphs
Guo, Xia · Yang, Yan
Original · EN
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ₙ× K₂, Kₘ,ₙ× K₂ and Kₙ,ₙ,ₙ× K₂.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.