当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The Tripartite-Circle Crossing Number of $K_{2,2,n}$
arXiv - CS - Discrete Mathematics Pub Date : 2021-08-02 , DOI: arxiv-2108.01032
Charles Camacho, Silvia Fernández-Merchant, Marija Jelić Milutinović, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White

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. The tripartite-circle crossing number of a tripartite graph is the minimum number of edge crossings among all tripartite-circle drawings. We determine the tripartite-circle crossing number of $K_{2,2,n}$.

中文翻译:

$K_{2,2,n}$的三方圆交叉数

三方图的三方圆图是平面中的图,其中顶点分区的每个部分都放置在三个不相交的圆之一上,并且边缘不与圆相交。三方图的三方圆交叉数是所有三方圆图中的最小边交叉数。我们确定 $K_{2,2,n}$ 的三方圆交叉数。
更新日期:2021-08-03
down
wechat
bug