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.

• 3 publications
• 35 publications
• 16 publications
• 34 publications
• 20 publications
research
09/01/2017

Mixed Linear Layouts of Planar Graphs

A k-stack (respectively, k-queue) layout of a graph consists of a total ...
research
07/29/2020

Book Embeddings of Graph Products

A k-stack layout (also called a k-page book embedding) of a graph consis...
research
08/23/2019

Mixed Linear Layouts: Complexity, Heuristics, and Experiments

A k-page linear graph layout of a graph G = (V,E) draws all vertices alo...
research
06/27/2023

On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs

Several types of linear layouts of graphs are obtained by leveraging kno...
research
09/01/2022

The Rique-Number of Graphs

We continue the study of linear layouts of graphs in relation to known d...
research
07/28/2021

On Families of Planar DAGs with Constant Stack Number

A k-stack layout (or k-page book embedding) of a graph consists of a tot...
research
09/12/2018

The Simple Chromatic Number of (m,n)-Mixed Graphs

An (m,n)-mixed graph generalizes the notions of oriented graphs and edge...