1-Gap Planarity Of Complete Bipartite Graphs

Christian Bachmaier,Ignaz Rutter,Peter Stumpf

GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2018（2018）

引用 0|浏览2

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要