On the queue-number of graphs with bounded tree-width

zbMath1358.05060arXiv1608.06091MaRDI QIDQ521397

Veit Wiechert

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.06091

File on IPFS

zbMATH Keywords

tree-widthgraph layoutsqueue layouts

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items (17)

Parameterized Algorithms for Queue Layouts ⋮ On the queue-number of partial orders ⋮ On the queue number of planar graphs ⋮ The mixed page number of graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ An improved upper bound on the queue number of planar graphs ⋮ Linear layouts of bipartite planar graphs ⋮ Lazy queue layouts of posets ⋮ Mixed Linear Layouts of Planar Graphs ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ On mixed linear layouts of series-parallel graphs ⋮ The Local Queue Number of Graphs with Bounded Treewidth ⋮ Parameterized Algorithms for Queue Layouts ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph layouts via layered separators
• Characterisations and examples of graph classes with bounded expansion
• Three-dimensional graph drawing
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Embedding planar graphs in four pages
• The book thickness of a graph
• Tree-partitions of infinite graphs
• Computing straight-line 3D grid drawings of graphs in linear volume
• Layered separators in minor-closed graph classes with applications
• Upward three-dimensional grid drawings of graphs
• Queue Layouts of Hypercubes
• Laying Out Graphs Using Queues
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
• Graph Drawing
• Layout of Graphs with Bounded Tree-Width
• On the Queue Number of Planar Graphs
• The pagenumber of \(k\)-trees is \(O(k)\)

This page was built for publication: On the queue-number of graphs with bounded tree-width