Stack and Queue Numbers of Graphs Revisited

03/17/2023
by   Petr Hliněný, et al.
0

A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmović and Wood in 2005, was "half-answered" by Dujmović, Eppstein, Hickingbotham, Morin and Wood in 2022; they proved the existence of a graph family with the queue number at most 4 but unbounded stack number. We give an alternative very short, and still elementary, proof of the same fact.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2020

Stack-number is not bounded by queue-number

We describe a family of graphs with queue-number at most 4 but unbounded...
research
05/16/2023

Stack number and queue number of graphs

In this paper we give an overview of the graph invariants queue number a...
research
02/10/2022

Three-dimensional graph products with unbounded stack-number

We prove that the stack-number of the strong product of three n-vertex p...
research
08/24/2020

On Mixed Linear Layouts of Series-Parallel Graphs

A mixed s-stack q-queue layout of a graph consists of a linear order of ...
research
08/16/2020

Erlang Redux: An Ansatz Method for Solving the M/M/m Queue

This exposition presents a novel approach to solving an M/M/m queue for ...
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
07/10/2023

Visibility and Separability for a Declarative Linearizability Proof of the Timestamped Stack: Extended Version

Linearizability is a standard correctness criterion for concurrent algor...

Please sign up or login with your details

Forgot password? Click here to reset