Answers are grounded in this paper and cite their sources.
We prove that planar graphs have O(log² n) queue number, thus improving upon the previous O(√ n) upper bound. Consequently, planar graphs admit three-dimensional straight-line crossing-free grid drawings in O(n log⁸ n) volume, thus improving upon the previous O(n3/2) upper bound.
No takes yet. Share an insight, caveat, or question.
Battista et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: