A note on the 4-girth-thickness of Kn,n,n

作者：Guo, Xia; Yang, Yan^*

来源：Ars Mathematica Contemporanea, 2019, 16(1): 19-24.

DOI：10.26493/1855-3974.1488.182

• Thickness
• 4-girth-thickness
• complete tripartite graph

The 4-girth-thickness theta(4, G) of a graph G is the minimum number of planar subgraphs of girth at least four whose union is G. In this paper, we obtain that the 4-girth-thickness of complete tripartite graph K-n,K- n,K- n is inverted right perpendicular n+1/2 inverted left perpendicular except for theta(4, K-1,K- 1,K- 1) = 2. And we also show that the 4-girth-thickness of the complete graph K-10 is three which disprove the conjecture posed by Rubio-Montiel concerning to theta(4, K-10).

• 出版日期2019
• 单位天津大学