Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)
-
摘要: 考虑两个平面图, 一个染成红色, 另一个染成绿色.两个图同时胞腔嵌入平面时,在一定的限制条件下, 红色的边与绿色的边会相交. 称这样的交点为交叉点.在所有的嵌入方式中交叉点的最小个数称为交叉数.本文利用图的划分和最小边割集,把这种交叉数问题转化为一类整数规划问题,得出了一些结果.Abstract: Consider a red planar graph and a green planar graphsimutaneously $2$-cell embedded on a surface. With some restriction,a red edge can cross a green edge. This paper studied the minimumnumber of these red-green crosses by using technique of integerprogramming, and some results are obtained.
点击查看大图
计量
- 文章访问数: 3330
- HTML全文浏览量: 17
- PDF下载量: 1394
- 被引次数: 0