Bounding the tripartite‐circle crossing number of complete tripartite graphs
Journal of Graph Theory(2021)
摘要
Abstract A tripartite‐circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles, and the edges do not cross the circles. We present upper and lower bounds on the minimum number of crossings in tripartite‐circle drawings of and the exact value for . In contrast to 1‐ and 2‐circle drawings, which may attain the Harary–Hill bound, our results imply that balanced restricted 3‐circle drawings of the complete graph are not optimal.
更多查看译文
关键词
graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要