On the generalised colouring numbers of graphs that exclude a fixed minor
From MaRDI portal
Publication:5920084
DOI10.1016/j.ejc.2017.06.019zbMath1369.05089arXiv1602.09052OpenAlexW2755112968MaRDI QIDQ5920084
Jan van den Heuvel, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz, Patrice Ossona de Mendez
Publication date: 11 September 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.09052
Related Items (19)
Improved bounds for weak coloring numbers ⋮ Chromatic numbers of exact distance graphs ⋮ Coloring and Covering Nowhere Dense Graphs ⋮ On coloring numbers of graph powers ⋮ On weighted sublinear separators ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Dimension is polynomial in height for posets with planar cover graphs ⋮ Bounding generalized coloring numbers of planar graphs using coin models ⋮ Clustering powers of sparse graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Uniform orderings for generalized coloring numbers ⋮ Boxicity, poset dimension, and excluded minors ⋮ On the weak 2-coloring number of planar graphs ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ Notes on graph product structure theory ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Sublinear Separators in Intersection Graphs of Convex Shapes ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Colouring graphs with bounded generalized colouring number
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- A short note about pursuit games played on a graph with a given genus
- On a pursuit game played on graphs for which a minor is excluded
- S-functions for graphs
- A simple competitive graph coloring algorithm
- Orderings on graphs and game coloring number
- The extremal function for complete minors
- Constant-factor approximation of the domination number in sparse graphs
- Graphs with linearly bounded Ramsey numbers
- Grad and classes with bounded expansion. I: Decompositions
- On nowhere dense graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- Colouring and Covering Nowhere Dense Graphs
- Radius two trees specify χ‐bounded classes
- Kernelization and Sparseness: the case of Dominating Set
- Deciding First-Order Properties of Nowhere Dense Graphs
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Cops, robbers, and threatening skeletons
- Testing first-order properties for subclasses of sparse graphs
This page was built for publication: On the generalised colouring numbers of graphs that exclude a fixed minor
