Notes on graph product structure theory
From MaRDI portal
Publication:2058955
DOI10.1007/978-3-030-62497-2_32zbMath1484.05176arXiv2001.08860OpenAlexW3175737004MaRDI QIDQ2058955
Gwenaël Joret, Tony Huynh, Zdeněk Dvořák, Chun-Hung Liu, David R. Wood
Publication date: 10 December 2021
Full work available at URL: https://arxiv.org/abs/2001.08860
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
Improved bounds for weak coloring numbers ⋮ Note on strong product graph dimension ⋮ Stack-number is not bounded by queue-number ⋮ Separating layered treewidth and row treewidth ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Graph product structure for non-minor-closed classes ⋮ Shorter Labeling Schemes for Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique minors in Cartesian products of graphs
- Sparsity. Graphs, structures, and algorithms
- Characterisations and examples of graph classes with bounded expansion
- Sublinear separators, fragility and subexponential expansion
- On tree-partition-width
- Colouring graphs with bounded generalized colouring number
- A partial k-arboretum of graphs with bounded treewidth
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- Graph minors. XVI: Excluding a non-planar graph
- Polynomial expansion and sublinear separators
- On classes of graphs with strongly sublinear separators
- Orderings on graphs and game coloring number
- Recognizing string graphs is decidable
- Treewidth of graphs with balanced separations
- Strongly Sublinear Separators and Polynomial Expansion
- Multiple-Source Shortest Paths in Embedded Graphs
- Parameters Tied to Treewidth
- A Separator Theorem for String Graphs and its Applications
- Map graphs
- Two lower bounds for $p$-centered colorings
- Graph minors. II. Algorithmic aspects of tree-width
- A Separator Theorem for Planar Graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Implicat Representation of Graphs
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Approximation algorithms for NP-complete problems on planar graphs
- Separators for sphere-packings and nearest neighbor graphs
- Coloring and Covering Nowhere Dense Graphs
- Nonrepetitive colorings of graphs
- Some results on tree decomposition of graphs
- 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
- Structure of Graphs with Locally Restricted Crossings
- Applications of a New Separator Theorem for String Graphs
- The intrinsic dimensionality of graphs
- On the generalised colouring numbers of graphs that exclude a fixed minor
This page was built for publication: Notes on graph product structure theory
