Open access
Date
2017Type
- Conference Paper
Abstract
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further show that quasiplanarity is witnessed by a simple topological drawing, that is, any two edges cross at most once and adjacent edges do not cross. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000224627Publication status
publishedExternal links
Book title
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)Journal / series
Leibniz International Proceedings in Informatics (LIPIcs)Volume
Pages / Article No.
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für InformatikEvent
Subject
graph drawing; near-planar graph; simple topological plane graphOrganisational unit
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)
More
Show all metadata