English

Simple $k$-Planar Graphs are Simple $(k+1)$-Quasiplanar

Computational Geometry 2020-04-10 v1 Discrete Mathematics Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.1909.00223,
  title  = {Simple $k$-Planar Graphs are Simple $(k+1)$-Quasiplanar},
  author = {Patrizio Angelini and Michael A. Bekos and Franz J. Brandenburg and Giordano Da Lozzo and Giuseppe Di Battista and Walter Didimo and Michael Hoffmann and Giuseppe Liotta and Fabrizio Montecchiani and Ignaz Rutter and Csaba D. Tóth},
  journal= {arXiv preprint arXiv:1909.00223},
  year   = {2020}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1705.05569

R2 v1 2026-06-23T11:02:08.427Z