Improved bounds for weak coloring numbers
From MaRDI portal
Publication:2121806
DOI10.37236/10274zbMath1486.05092arXiv2102.10061OpenAlexW3129935410MaRDI QIDQ2121806
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10061
Related Items (3)
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
Cites Work
- Nonrepetitive colorings of graphs of bounded tree-width
- Colouring graphs with bounded generalized colouring number
- Chromatic numbers of exact distance graphs
- Polynomial expansion and sublinear separators
- 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
- On fractional fragility rates of graph classes
- Uniform orderings for generalized coloring numbers
- Graphs with linearly bounded Ramsey numbers
- Nowhere dense graph classes and dimension
- Strongly Sublinear Separators and Polynomial Expansion
- Two lower bounds for $p$-centered colorings
- Coloring and Covering Nowhere Dense Graphs
- Improper colourings inspired by Hadwiger's conjecture
- Kernelization and Sparseness: the case of Dominating Set
- Sublinear Separators in Intersection Graphs of Convex Shapes
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Planar Graphs Have Bounded Queue-Number
- Improved Bounds for Centered Colorings
- On distance ‐dominating and ‐independent sets in sparse graphs
- On the generalised colouring numbers of graphs that exclude a fixed minor
This page was built for publication: Improved bounds for weak coloring numbers
