Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Queue Layouts of Graphs with Bounded Degree and Bounded Genus (1901.05594v2)

Published 17 Jan 2019 in math.CO and cs.DM

Abstract: Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree $\Delta$ have queue-number $O(\Delta{2})$, which improves upon the best previous bound of $O(\Delta6)$. More generally, we prove that graphs with bounded degree and bounded Euler genus have bounded queue-number. In particular graphs with Euler genus $g$ and maximum degree $\Delta$ have queue-number $O(g+\Delta{2})$. As a byproduct we prove that if planar graphs have bounded queue-number, then graphs of Euler genus $g$ have queue-number $O(g)$.

Citations (7)

Summary

We haven't generated a summary for this paper yet.