Planar Graphs of Bounded Degree have Constant Queue Number

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the minimum number of queues required by any of its queue layouts. A long-standing conjecture by Heath, Leighton and Rosenberg states that the queue number of planar graphs is bounded. This conjecture has been partially settled in the positive for several subfamilies of planar graphs (most of which have bounded treewidth). In this paper, we make a further important step towards settling this conjecture. We prove that planar graphs of bounded degree (which may have unbounded treewidth) have bounded queue number. A notable implication of this result is that every planar graph of bounded degree admits a three-dimensional straight-line grid drawing in linear volume. Further implications are that every planar graph of bounded degree has bounded track number, and that every $k$-planar graph (i.e., every graph that can be drawn in the plane with at most $k$ crossings per edge) of bounded degree has bounded queue number.

[1]  Pat Morin,et al.  Queue Layouts of Graphs with Bounded Degree and Bounded Genus , 2019, ArXiv.

[2]  Timothy M. Chan.  Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[3]  Lenwood S. Heath,et al.  Laying out Graphs Using Queues , 1992, SIAM J. Comput..

[4]  David Eppstein,et al.  Track Layouts, Layered Path Decompositions, and Leveled Planarity , 2018, Algorithmica.

[5]  Pat Morin,et al.  Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs , 2002, GD.

[6]  Oleg V. Borodin,et al.  On acyclic colorings of planar graphs , 2006, Discret. Math..

[7]  David R. Wood.  Bounded-Degree Graphs have Arbitrarily Large Queue-Number , 2008, Discret. Math. Theor. Comput. Sci..

[8]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[9]  Emilio Di Giacomo,et al.  Computing straight-line 3D grid drawings of graphs in linear volume , 2005, Comput. Geom..

[10]  Joseph L. Ganley,et al.  Stack and Queue Layouts of Halin Graphs , 2001 .

[11]  Robert E. Tarjan,et al.  Sorting Using Networks of Queues and Stacks , 1972, J. ACM.

[12]  Vida Dujmovic.  Graph layouts via layered separators , 2015, J. Comb. Theory, Ser. B.

[13]  Arnold L. Rosenberg,et al.  Comparing Queues and Stacks as Mechanisms for Laying out Graphs , 1992, SIAM J. Discret. Math..

[14]  Stefan Felsner,et al.  Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions , 2001, J. Graph Algorithms Appl..

[15]  Arnold L. Rosenberg,et al.  Three-Dimensional Circuit Layouts , 1984, SIAM J. Comput..

[16]  Pat Morin,et al.  Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[17]  David R. Wood,et al.  Track Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..

[18]  Veit Wiechert,et al.  On the Queue-Number of Graphs with Bounded Tree-Width , 2016, Electron. J. Comb..

[19]  Sriram Venkata Pemmarju.  Exploring the powers of stacks and queues via graph layouts , 1992 .

[20]  Arnold L. Rosenberg,et al.  Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off , 1996, J. Parallel Distributed Comput..

[21]  David R. Wood,et al.  Three-Dimensional Grid Drawings with Sub-quadratic Volume , 2003, GD.

[22]  David R. Wood,et al.  On Linear Layouts of Graphs , 2004, Discret. Math. Theor. Comput. Sci..

[23]  Vida Dujmovic,et al.  Stack and Queue Layouts via Layered Separators , 2016, GD.

[24]  David R. Wood,et al.  Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing , 2002, FSTTCS.

[25]  Pat Morin,et al.  Layout of Graphs with Bounded Tree-Width , 2004, SIAM J. Comput..

[26]  Pat Morin,et al.  Layered separators in minor-closed graph classes with applications , 2013, J. Comb. Theory, Ser. B.

[27]  Sergey Pupyrev.  Mixed Linear Layouts of Planar Graphs , 2017, Graph Drawing.

[28]  János Pach,et al.  On the Queue Number of Planar Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[29]  Mihalis Yannakais,et al.  Embedding planar graphs in four pages , 1989, STOC 1989.

[30]  Michael A. Bekos,et al.  Queue Layouts of Planar 3-Trees , 2018, Algorithmica.

[31]  C. E. Veni Madhavan,et al.  Stack and Queue Number of 2-Trees , 1995, COCOON.

[32]  Mihalis Yannakakis,et al.  Embedding Planar Graphs in Four Pages , 1989, J. Comput. Syst. Sci..

[33]  Pat Morin,et al.  Planar Graphs have Bounded Queue-Number , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[34]  David R. Wood,et al.  Stacks, Queues and Tracks: Layouts of Graph Subdivisions , 2005, Discret. Math. Theor. Comput. Sci..

[35]  János Pach,et al.  Three-dimensional Grid Drawings of Graphs , 1997, GD.