Simple

Patrizio Angelini,Michael A. Bekos,Franz J. Brandenburg,Giordano Da Lozzo,Giuseppe Di Battista,Walter Didimo,Michael Hoffmann,Giuseppe Liotta,Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth

Journal of Combinatorial Theory Series B（2020）

引用 0|浏览2

暂无评分

摘要

A simple topological graph is k -quasiplanar (k ≥ 2) if it contains no k pairwise crossing edges, and k -planar if no edge is crossed more than k times. In this paper, we explore the relationship between k -planarity and k -quasiplanarity to show that, for k ≥ 2, every k -planar simple topological graph can be transformed into a ( k + 1 )-quasiplanar simple topological graph.

查看译文

关键词

Topological graphs,Graph drawing,k-Planar graphs,k-Quasiplanar graphs,Beyond planarity

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要