论文标题

粉丝平面图的厚度最多为三个

The thickness of fan-planar graphs is at most three

论文作者

Cheong, Otfried, Pfister, Maximilian, Schlipf, Lena

论文摘要

我们证明,在图G的任何强烈粉丝平面图中,边缘最多都可以颜色三种颜色,因此没有两个相同颜色交叉的边缘。这意味着强烈的粉丝平面图的厚度最多是三个。如果g是双方的,则两种颜色足以以这种方式为边缘着色。

We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most three. If G is bipartite, then two colors suffice to color the edges in this way.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源