Queue Layouts of Graphs with Bounded Degree and Bounded Genus

01/17/2019 ∙ by Vida Dujmovic, et al. ∙ Carleton University Monash University uOttawa 0

We prove that graphs with bounded degree and bounded Euler genus have bounded queue-number. As a byproduct we prove that if planar graphs have bounded queue-number (which is an open problem), then graphs of Euler genus g have queue-number O(g).

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Bekos et al. [1] recently proved that planar graphs with bounded (maximum) degree have bounded queue-number. We extend this result by showing that graphs with bounded degree and bounded genus have bounded queue-number.

First we introduce queue layouts and give the background to the above results. For a graph and integer , a -queue layout of consists of a linear ordering of and a partition of , such that for , no two edges in are nested with respect to . Here edges and are nested if . The queue-number of a graph is the minimum integer such that has a -queue layout. These definitions were introduced by Heath et al. [12, 13] as a dual to stack layouts (also called book embeddings).

Heath et al. [12] conjectured that every planar graph has bounded queue number. This conjecture has remained open despite much research on queue layouts [18, 3, 10, 12, 13, 11, 16, 17, 5, 8, 7, 14, 6]. Dujmović and Wood [8] observed that every graph with edges has a -queue layout using a random vertex ordering. Thus every planar graph with vertices has queue-number . Di Battista et al. [2] proved the first breakthrough on this topic, by showing that every planar graph with vertices has queue-number . Dujmović [4] improved this bound to with a simpler proof.

Dujmović et al. [6] established (poly-)logarithmic bounds for more general classes of graphs111The Euler genus of a graph is the minimum integer such that embeds in the orientable surface with handles (and is even) or the non-orientable surface with cross-caps. Of course, a graph is planar if and only if it has Euler genus 0; see [15] for more about graph embeddings in surfaces. A graph is a minor of a graph if a graph isomorphic to can be obtained from a subgraph of by contracting edges. . For example, they proved that every graph with vertices and Euler genus has queue-number , and that every graph with vertices excluding a fixed minor has queue-number .

Recently, Bekos et al. [1] proved a second breakthrough result, by showing that planar graphs with bounded degree have bounded queue-number.

Theorem 1 ([1]).

Every planar graph with maximum degree has queue-number at most .

Note that bounded degree alone is not enough to ensure bounded queue-number. In particular, Wood [19] proved that for every integer and all sufficiently large , there are graphs with vertices, maximum degree , and queue-number .

The first contribution of this paper is to extend the result of Bekos et al. [1], by showing that graphs with bounded Euler genus and bounded degree have bounded queue-number.

Theorem 2.

Every graph with Euler genus and maximum degree has queue-number at most .

We remark that using well-known constructions [5, 7, 9], Theorem 2 implies that graphs with bounded Euler genus and bounded degree have bounded track-number, which in turn can be used to prove linear volume bounds for three-dimensional straight-line grid drawings of the same class of graphs. These results can also be extended for graphs with bounded degree that can be drawn in a surface of bounded Euler genus with a bounded number of crossings per edge (using [10, Theorem 6]). We omit all these details in this note.

The proof of Theorem 2 uses Theorem 1 as a ‘black box’. Starting with a graph of bounded Euler genus and bounded degree, we construct a planar subgraph of . We then apply Theorem 1 to obtain a queue layout of , from which we construct a queue layout of . This approach suggests a direct connection between the queue-number of graphs with bounded Euler genus and planar graphs, regardless of degree considerations. The following theorem establishes this connection. A class of graphs is hereditary if it is closed under taking induced subgraphs.

Theorem 3.

Let be a hereditary class of graphs, such that every planar graph in has queue-number at most . Then every graph in with Euler genus has queue-number at most .

Theorem 2 is an immediate corollary of Theorems 3 and 1, where is the class of graphs with maximum degree at most . Theorem 3, where is the class of all graphs, implies the following result of interest:

Corollary 4.

If every planar graph has queue-number at most , then every graph with Euler genus has queue-number at most .

2 The Proof

The following definition is a key concept in our proofs (and that of several other papers on queue layouts [6, 5, 8]). A layering of a graph is a partition of such that for every edge , if and , then . If is a vertex in a connected graph and for all , then is called a bfs layering of .

Lemma 5.

Let be a connected graph with Euler genus . For every bfs layering of , there is a set with at most vertices in each layer , such that is planar.

Proof.

Fix an embedding of in a surface of Euler genus . Say has vertices, edges, and faces. By Euler’s formula, . Let be a bfs layering of rooted at some vertex . Let be the corresponding bfs spanning tree. Let be the graph with , where for each edge of , if and are the faces of with on their boundary, then there is an edge in . (Think of as the spanning subgraph of consisting of those edges that do not cross edges in .) Note that and . Since is a tree, is connected; see [6, Lemma 11] for a proof. Let be a spanning tree of . Let . Thus . Say . For , let be the union of the -path and the -path in , plus the edge . Let be . Say has vertices and edges. Since consists of a subtree of plus the edges in , we have .

We now describe how to ‘cut’ along the edges of to obtain a new graph ; see Figure 1. First, each edge of is replaced by two edges and in . Each vertex of incident with no edges in is untouched. Consider a vertex of incident with edges in in clockwise order. In replace by new vertices , where is incident with , and all the edges incident with clockwise from to (exclusive). Here means and means . This operation defines a cyclic ordering of the edges in incident with each vertex (where is followed by in the cyclic order at ). This in turn defines an embedding of in some orientable surface. (Note that if is embedded in a non-orientable surface, then the edge signatures for are ignored in the embedding of .)

Figure 1: Cutting the blue edges in at each vertex.

Say has vertices and edges, and the embedding of ’ has faces and Euler genus . Each vertex in with degree in is replaced by vertices in . Each edge in is replaced by two edges in , while each edge of is maintained in . Thus

and . Each face of is preserved in . Say new faces are created by the cutting. Thus . Since is connected, it follows that is connected. By Euler’s formula, . Thus , implying . Hence , implying . Since and , we have and . Therefore is planar.

Note that is a subgraph of , and is planar. By construction, each path has at most two vertices in each layer . Thus has at most vertices in each . ∎

We need the following lemma of independent interest.

Lemma 6.

If a graph has a -queue layout, and is a layering of , then has a -queue layout using ordering .

Proof.

Say is the edge-partition and is the ordering of in a -queue layout of . For , let be the set of edges with for some ; let be the set of edges with and and for some ; and let be the set of edges with and and for some . Then is a partition of .

Let be the ordering of where each is ordered by . No two edges in some set are nested in , as otherwise the same two edges would be in and would be nested in . Suppose that for some edges . So and for some , and and . Now by the definition of . Hence , which is a contradiction since both and are in . Thus no two edges in are nested in . By symmetry, no two edges in are nested in . Hence is the ordering in a -queue layout of . ∎

We now prove our main result.

Proof of Theorem 3.

Let be a graph in with Euler genus . Since the queue-number of equals the maximum queue-number of the connected components of , we may assume that is connected. Let be a bfs layering of . By Lemma 5, there is a set with at most vertices in each layer , such that is planar. Since is hereditary, , and by assumption has a -queue layout. Note that is a layering of . By Lemma 6, has a -queue layout using ordering . Recall that for all . Let be the ordering

of . where each set is ordered arbitrarily, and each set is ordered according to the above -queue layout of . Edges of inherit their queue assignment. We now assign edges incident with vertices in to queues. For

and odd

, put each edge incident with the -th vertex in in a new queue . For and even , put each edge incident with the -th vertex in (not already assigned to a queue) in a new queue . Suppose that two edges and in are nested, where . Say and and and . By construction, . Since is an edge, . At least one endpoint of is in for some odd , and one endpoint of is in for some odd . Since are distinct, . Thus . This is a contradiction since . Thus is a queue. Similarly is a queue. Hence this step introduces new queues. We obtain a -queue layout of . ∎

3 Minors

Whether the result of Bekos et al. [1] can be generalised for arbitrary excluded minors is an interesting question. That is, do graphs excluding a fixed minor and with bounded degree have bounded queue-number? It might even be true that graphs excluding a fixed minor have bounded queue-number.

References

  • Bekos et al. [2018] Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, and Torsten Ueckerdt. Planar graphs of bounded degree have constant queue number. 2018. arXiv: 1811.00816.
  • Di Battista et al. [2013] Giuseppe Di Battista, Fabrizio Frati, and János Pach. On the queue number of planar graphs. SIAM J. Comput., 42(6):2243–2285, 2013. doi: 10.1137/130908051. MR: 3141759.
  • Di Giacomo and Meijer [2004] Emilio Di Giacomo and Henk Meijer. Track drawings of graphs with constant queue number. In Giuseppe Liotta, ed., Proc. 11th International Symp. on Graph Drawing (GD ’03), vol. 2912 of Lecture Notes in Comput. Sci., pp. 214–225. Springer, 2004. doi: 10.1007/978-3-540-24595-7_20.
  • Dujmović [2015] Vida Dujmović. Graph layouts via layered separators. J. Combin. Theory Series B., 110:79–89, 2015. doi: 10.1016/j.jctb.2014.07.005. MR: 3279388.
  • Dujmović et al. [2005] Vida Dujmović, Pat Morin, and David R. Wood. Layout of graphs with bounded tree-width. SIAM J. Comput., 34(3):553–579, 2005. doi: 10.1137/S0097539702416141. MR: 2137079.
  • Dujmović et al. [2017] Vida Dujmović, Pat Morin, and David R. Wood. Layered separators in minor-closed graph classes with applications. J. Combin. Theory Ser. B, 127:111–147, 2017. doi: 10.1016/j.jctb.2017.05.006. MR: 3704658.
  • Dujmović et al. [2004] Vida Dujmović, Attila Pór, and David R. Wood. Track layouts of graphs. Discrete Math. Theor. Comput. Sci., 6(2):497–522, 2004. http://dmtcs.episciences.org/315. MR: 2180055.
  • Dujmović and Wood [2004a] Vida Dujmović and David R. Wood. On linear layouts of graphs. Discrete Math. Theor. Comput. Sci., 6(2):339–358, 2004a. http://dmtcs.episciences.org/317. MR: 2081479.
  • Dujmović and Wood [2004b] Vida Dujmović and David R. Wood. Three-dimensional grid drawings with sub-quadratic volume. In János Pach, ed., Towards a Theory of Geometric Graphs, vol. 342 of Contemporary Mathematics, pp. 55–66. Amer. Math. Soc., 2004b. MR: 2065252.
  • Dujmović and Wood [2005] Vida Dujmović and David R. Wood. Stacks, queues and tracks: Layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci., 7:155–202, 2005. http://dmtcs.episciences.org/346. MR: 2164064.
  • Hasunuma [2007] Toru Hasunuma. Queue layouts of iterated line directed graphs. Discrete Appl. Math., 155(9):1141–1154, 2007. doi: 10.1016/j.dam.2006.04.045. MR: 2321020.
  • Heath et al. [1992] Lenwood S. Heath, F. Thomson Leighton, and Arnold L. Rosenberg. Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math., 5(3):398–412, 1992. doi: 10.1137/0405031. MR: 1172748.
  • Heath and Rosenberg [1992] Lenwood S. Heath and Arnold L. Rosenberg. Laying out graphs using queues. SIAM J. Comput., 21(5):927–958, 1992. doi: 10.1137/0221055. MR: 1181408.
  • Miyauchi [2007] Miki Shimabara Miyauchi. Queue layout of bipartite graph subdivisions. IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, E90-A(5):896–899, 2007.
  • Mohar and Thomassen [2001] Bojan Mohar and Carsten Thomassen. Graphs on surfaces. Johns Hopkins University Press, 2001. MR: 1844449.
  • Pemmaraju [1992] Sriram V. Pemmaraju. Exploring the Powers of Stacks and Queues via Graph Layouts. Ph.D. thesis, Virginia Polytechnic Institute and State University, U.S.A., 1992.
  • Rengarajan and Veni Madhavan [1995] S. Rengarajan and C. E. Veni Madhavan. Stack and queue number of -trees. In Ding-Zhu Du and Ming Li, eds., Proc. 1st Annual International Conf. on Computing and Combinatorics (COCOON ’95), vol. 959 of Lecture Notes in Comput. Sci., pp. 203–212. Springer, 1995. doi: 10.1007/BFb0030834.
  • Wiechert [2017] Veit Wiechert. On the queue-number of graphs with bounded tree-width. Electron. J. Combin., 24(1):1.65, 2017. http://www.combinatorics.org/v24i1p65. MR: 3651947.
  • Wood [2008] David R. Wood. Bounded-degree graphs have arbitrarily large queue-number. Discrete Math. Theor. Comput. Sci., 10(1):27–34, 2008. http://dmtcs.episciences.org/434. MR: 2369152.