There exist graphs where avoiding forbidden crossing patterns forces linearly many crossings, while unconstrained drawings need only a constant number of crossings.
Discrete Comput
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Crossing Numbers of Beyond-Planar Graphs
There exist graphs where avoiding forbidden crossing patterns forces linearly many crossings, while unconstrained drawings need only a constant number of crossings.