Two planar graphs plus a tree always admit a simultaneous quasiplanar embedding, but simple instances with two quasiplanar graphs and a star, and fixed-drawing matching pairs, can fail.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The QuaSEFE Problem
Two planar graphs plus a tree always admit a simultaneous quasiplanar embedding, but simple instances with two quasiplanar graphs and a star, and fixed-drawing matching pairs, can fail.