Separating layered treewidth and row treewidth
From MaRDI portal
Publication:6045398
DOI10.46298/dmtcs.7458zbMath1520.05028arXiv2105.01230MaRDI QIDQ6045398
Mehrnoosh Javarsineh, Pat Morin, David R. Wood, Prosenjit Bose, Vida Dujmović
Publication date: 30 May 2023
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01230
Related Items
An improved planar graph product structure theorem ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The product structure of squaregraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterisations and examples of graph classes with bounded expansion
- Graph minors. I. Excluding a forest
- Quickly excluding a forest
- A partial k-arboretum of graphs with bounded treewidth
- The vertex separation and search number of a graph
- Track layouts, layered path decompositions, and leveled planarity
- Notes on graph product structure theory
- Layered separators in minor-closed graph classes with applications
- Clustered variants of Hajós' conjecture
- Stack and Queue Layouts via Layered Separators
- Parameters Tied to Treewidth
- Two lower bounds for $p$-centered colorings
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Coloring and Covering Nowhere Dense Graphs
- Improper colourings inspired by Hadwiger's conjecture
- Adjacency Labelling for Planar Graphs (and Beyond)
- Improved Bounds for Track Numbers of Planar Graphs
- Planar graphs have bounded nonrepetitive chromatic number
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Planar Graphs Have Bounded Queue-Number
- Shorter Labeling Schemes for Planar Graphs
- Improved Bounds for Centered Colorings
- Better bounds for poset dimension and boxicity
