The Thickness of K_1,n,n and K_2,n,n
arXiv:1805.09689 · doi:10.26493/1855-3974.1223.b26
Abstract
The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph K_1,n,n, K_2,n,n and complete 4-partite graph K_1,1,n,n.