A note on the thickness

作者：Yang, Yan^*

来源：Ars Combinatoria, 2014, 117: 349-351.

• thickness
• complete tripartite graph
• planar subgraphs decomposition

The thickness theta(G) of a graph G is the minimum number of planar spanning subgraphs into which G can be decomposed. In this note, we obtain the thickness of the complete tripartite graph K-l,K-m,K-n(l <= m <= n) for the following cases: (1) l + m <= 5; (2) l + m is even and n > 1/2 (l + m - 2)(2); (3) l + m is odd and n > (l + m - 2)(l + m - 1).

• 出版日期2014-10
• 单位天津大学