1-Gap Planarity of Complete Bipartite Graphs

被引：0
|
作者：
Bachmaier, Christian [1 ]
Rutter, Ignaz [1 ]
Stumpf, Peter [1 ]
机构：
[1] Univ Passau, Fac Comp Sci & Math, Passau, Germany
来源：
GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018 | 2018年 / 11282卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
A graph is 1-gap planar if it admits a drawing such that each crossing can be assigned to one of the two involved edges in such a way that each edge is assigned at most one crossing. We show that K-3,K-14,K- K-4,K-10 and K-6,K-6 are not 1-gap planar.
引用
收藏
页码：646 / 648
页数：3
相关论文
共 50 条
12345