The thickness of the Kronecker product of graphs

Authors

DOI:

https://doi.org/10.26493/1855-3974.1998.2f4

Keywords:

Thickness, Kronecker product graph, planar decomposition

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 Kn × K2, Km, n × K2 and Kn, n, n × K2.

Downloads

Published

2020-10-22

Issue

Vol. 18 No. 2 (2020)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/