Simple $k$-Planar Graphs are Simple $(k+1)$-Quasiplanar
Computational Geometry
2020-04-10 v1 Discrete Mathematics
Combinatorics
Abstract
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we explore the relationship between -planarity and -quasiplanarity to show that, for , every -planar simple topological graph can be transformed into a -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