Planar graphs of bounded degree have bounded queue number

DOI10.1145/3313276.3316324MaRDI QIDQ5212758zbMATH OpenOpenAlexWikidataFDO

Authors Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt

Publication date 30 January 2020

Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313276.3316324

zbMATH Keywords

graph algorithmsplanar graphsqueue number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Planar graphs of bounded degree have bounded queue number
• On the Queue Number of Planar Graphs
• Queue layouts, tree-width, and three-dimensional graph drawing
• An improved upper bound on the queue number of planar graphs
• Graph layouts via layered separators

Cited in

(8)

• On the queue number of planar graphs
• An improved upper bound on the queue number of planar graphs
• Queue layouts, tree-width, and three-dimensional graph drawing
• Planar graphs have bounded queue-number
• Planar graphs of bounded degree have bounded queue number
• Bounded-degree graphs have arbitrarily large queue-number
• On the Queue Number of Planar Graphs
• Queue layouts of planar 3-trees

This page was built for publication: Planar graphs of bounded degree have bounded queue number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212758)