Shallow Minors, Graph Products, and Beyond-Planar Graphs
From MaRDI portal
Publication:6130539
DOI10.1137/22m1540296arXiv2111.12412OpenAlexW3216235219MaRDI QIDQ6130539
David R. Wood, Robert Hickingbotham
Publication date: 3 April 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.12412
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- On the queue-number of graphs with bounded tree-width
- Characterisations and examples of graph classes with bounded expansion
- Boxicity, poset dimension, and excluded minors
- Drawing graphs with right angle crossings
- Nonrepetitive colorings of graphs of bounded tree-width
- Colouring graphs with bounded generalized colouring number
- Interval representations of planar graphs
- Graphs drawn with few crossings per edge
- A partial k-arboretum of graphs with bounded treewidth
- Graph minors. XVI: Excluding a non-planar graph
- Diameter and treewidth in minor-closed graph families
- Polynomial expansion and sublinear separators
- 1-fan-bundle-planar drawings of graphs
- Gap-planar graphs
- Orderings on graphs and game coloring number
- Constant-factor approximation of the domination number in sparse graphs
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- Notes on graph product structure theory
- The density of fan-planar graphs
- Improved bounds for weak coloring numbers
- Nonrepetitive graph colouring
- Stack-number is not bounded by queue-number
- Simplifying non-simple fan-planar drawings
- An improved planar graph product structure theorem
- Graphs with linearly bounded Ramsey numbers
- Defective colouring of graphs excluding a subgraph or minor
- Fan-planarity: properties and complexity
- Layered separators in minor-closed graph classes with applications
- Grad and classes with bounded expansion. I: Decompositions
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- An improved upper bound on the queue number of planar graphs
- Strongly Sublinear Separators and Polynomial Expansion
- On the Number of Edges of Fan-Crossing Free Graphs
- Parameters Tied to Treewidth
- Acyclic and oriented chromatic numbers of graphs
- The crossing number ofK1,3,n andK2,3,n
- Graph minors. II. Algorithmic aspects of tree-width
- Crossing-Free Subgraphs
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Radius two trees specify χ‐bounded classes
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Coloring and Covering Nowhere Dense Graphs
- Improper colourings inspired by Hadwiger's conjecture
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Deciding First-Order Properties of Nowhere Dense Graphs
- Nonrepetitive colorings of graphs
- Tree densities in sparse graph classes
- Adjacency Labelling for Planar Graphs (and Beyond)
- Planar graphs have bounded nonrepetitive chromatic number
- Planar Graphs Have Bounded Queue-Number
- Improved Bounds for Centered Colorings
- Better bounds for poset dimension and boxicity
- Layout of Graphs with Bounded Tree-Width
- Shorter Labeling Schemes for Planar Graphs
- On the generalised colouring numbers of graphs that exclude a fixed minor
- Separating layered treewidth and row treewidth
- Improved product structure for graphs on surfaces
- Graph product structure for non-minor-closed classes
- The thickness of fan-planar graphs is at most three
This page was built for publication: Shallow Minors, Graph Products, and Beyond-Planar Graphs
