# The Local Queue Number of Graphs with Bounded Treewidth

A queue layout of a graph G consists of a vertex ordering of G and a partition of the edges into so-called queues such that no two edges in the same queue nest, i.e., have their endpoints ordered in an ABBA-pattern. Continuing the research on local ordered covering numbers, we introduce the local queue number of a graph G as the minimum ℓ such that G admits a queue layout with each vertex having incident edges in no more than ℓ queues. Similarly to the local page number [Merker, Ueckerdt, GD'19], the local queue number is closely related to the graph's density and can be arbitrarily far from the classical queue number. We present tools to bound the local queue number of graphs from above and below, focusing on graphs of treewidth k. Using these, we show that every graph of treewidth k has local queue number at most k+1 and that this bound is tight for k=2, while a general lower bound is ⌈ k/2⌉+1. Our results imply, inter alia, that the maximum local queue number among planar graphs is either 3 or 4.

Comments

There are no comments yet.

## Authors

• 3 publications
• 23 publications
• ### Queue Layouts of Planar 3-Trees

A queue layout of a graph G consists of a linear order of the vertices o...
08/31/2018 ∙ by Michael A. Bekos, et al. ∙ 0

read it

• ### Linear Layouts of Complete Graphs

A page (queue) with respect to a vertex ordering of a graph is a set of ...
08/11/2021 ∙ by Stefan Felsner, et al. ∙ 0

read it

• ### Planar Graphs of Bounded Degree have Constant Queue Number

A queue layout of a graph consists of a linear order of its vertices and...
11/02/2018 ∙ by Michael A. Bekos, et al. ∙ 0

read it

• ### Parameterized Algorithms for Queue Layouts

An h-queue layout of a graph G consists of a linear order of its vertice...
08/19/2020 ∙ by Sujoy Bhore, et al. ∙ 0

read it

• ### Book Embeddings of Graph Products

A k-stack layout (also called a k-page book embedding) of a graph consis...
07/29/2020 ∙ by Sergey Pupyrev, et al. ∙ 0

read it

• ### Generating Weakly Chordal Graphs from Arbitrary Graphs

We propose a scheme for generating a weakly chordal graph from a randoml...
03/20/2020 ∙ by Sudiksha Khanduja, et al. ∙ 0

read it

• ### Layouts for Plane Graphs on Constant Number of Tracks

A k-track layout of a graph consists of a vertex k colouring, and a tota...
08/07/2017 ∙ by Jiun-Jie Wang, et al. ∙ 0

read it

##### This week in AI

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