The Mixed Page Number of Graphs

A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout. Mixed linear layouts combine these layouts by allowing each set of edges to form either a stack or a queue. In this work we initiate the study of the mixed page number of a graph which corresponds to the minimum number of such sets. First, we study the edge density of graphs with bounded mixed page number. Then, we focus on complete and complete bipartite graphs, for which we derive lower and upper bounds on their mixed page number. Our findings indicate that combining stacks and queues is more powerful in various ways compared to the two traditional layouts.

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

[2]  Klaus W. Wagner,et al.  Monotonic Coverings of Finite Sets , 1984, J. Inf. Process. Cybern..

[3]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[4]  B. Mohar,et al.  Graph minors XXIII. Nash-Williams' immersion conjecture , 2010, J. Comb. Theory B.

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

[6]  Martin Nöllenburg,et al.  Mixed Linear Layouts: Complexity, Heuristics, and Experiments , 2019, Graph Drawing.

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

[8]  Michael A. Bekos,et al.  On Mixed Linear Layouts of Series-Parallel Graphs , 2020, ArXiv.

[9]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[10]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[11]  David Eppstein,et al.  Stack-number is not bounded by queue-number , 2021, Combinatorica.

[12]  Miyauchi Miki,et al.  Stack Queue Mixed layout of graph subdivisions , 2013 .

[13]  Michael A. Bekos,et al.  Four Pages Are Indeed Necessary for Planar Graphs , 2020, J. Comput. Geom..

[14]  Lenwood S. Heath,et al.  The pagenumber of k-trees is O(k) , 2001, Discret. Appl. Math..

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

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

[17]  Michael A. Bekos,et al.  The Book Embedding Problem from a SAT-Solving Perspective , 2015, Graph Drawing.

[18]  Michael A. Bekos,et al.  Planar graphs of bounded degree have bounded queue number , 2019, STOC.

[19]  Sergey Pupyrev,et al.  Book Embeddings of Graph Products , 2020, ArXiv.

[20]  Dieter Kratsch,et al.  On Partitions of Permutations into Increasing and Decreasing Subsequences , 1986, J. Inf. Process. Cybern..

[21]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[22]  Douglas B. West,et al.  Pagenumber of complete bipartite graphs , 1988, J. Graph Theory.

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

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

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

[26]  Graphs with E edges have pagenumber O(√E) , 1994, FOCS 1994.

[27]  Maria J. Serna,et al.  Parameterized Complexity for Graph Layout Problems , 2005, Bull. EATCS.

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