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.
@article{arxiv.1805.09689,
title = {The Thickness of K_1,n,n and K_2,n,n},
author = {Xia Guo and Yan Yang},
journal= {arXiv preprint arXiv:1805.09689},
year = {2020}
}