Remarks on the thickness of K_n,n,n
Yan T. Yang · Ars Mathematica Contemporanea · 2016
The thickness θ(G) of a graph G is the minimum number of planar subgraphs into which G can be decomposed. In this paper, we provide a new upper bound for the thickness of the complete tripartite graphs Kn, n, n (n ≥ 3) and obtain θ(Kn, n, n) = ⌈(n + 1) / 3⌉, when n ≡ 3 (mod 6).