The Thickness of Some Complete Bipartite and Tripartite Graphs

被引：0
|
作者：
Hu, Si-wei [1 ]
Chen, Yi-chao [2 ]
机构：
[1] Yali Peicui Sch, Changsha 410021, Peoples R China
[2] Suzhou Univ Sci & Technol, Sch Math, Suzhou 215009, Peoples R China
来源：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2024年 / 40卷 / 04期
关键词：
thickness; complete bipartite graph; complete tripartite graph; planar decomposition;
D O I：
10.1007/s10255-024-1128-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we obtain the thickness for some complete k partite graphs for k = 2; 3: We first compute the thickness of Kn;n+8 by giving a planar decomposition of K4k for k 3. Then, two planar decompositions for K1;g;g(g when g is even and for K 1;g; 1 2 (g when g is odd are obtained. Using a recursive construction, we also obtain the thickness for some complete tripartite graphs. The results here support the long-standing conjecture that the thickness of Km;n is. mn 2(m+n. for any positive integers m; n
引用
收藏
页码：1001 / 1014
页数：14
相关论文
共 50 条
12345