Uniform orderings for generalized coloring numbers

DOI10.1016/j.ejc.2020.103214zbMath1458.05085arXiv1907.12149OpenAlexW3081344375MaRDI QIDQ2225419

Henry A. Kierstead, Jan van den Heuvel

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12149

zbMATH Keywords

planar graphs\(k\)-coloring number\(k\)-game coloring numbernowhere dense graph classes

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Density (toughness, etc.) (05C42)

Related Items

Improved bounds for weak coloring numbers, On coloring numbers of graph powers, Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes, On the weak 2-coloring number of planar graphs

Cites Work

• Sparsity. Graphs, structures, and algorithms
• Colouring graphs with bounded generalized colouring number
• A simple competitive graph coloring algorithm
• Orderings on graphs and game coloring number
• Constant-factor approximation of the domination number in sparse graphs
• On coloring numbers of graph powers
• Graphs with linearly bounded Ramsey numbers
• Nowhere dense graph classes and dimension
• Game colouring directed graphs
• Grad and classes with bounded expansion. I: Decompositions
• On nowhere dense graphs
• Refined activation strategy for the marking game
• Very asymmetric marking games
• Tree-depth, subgraph coloring and homomorphism bounds
• Dimension and height for posets with planar cover graphs.
• Colouring and Covering Nowhere Dense Graphs
• Graph Theory
• Strong Chromatic Index of Sparse Graphs
• Enumeration of monadic second-order queries on trees
• Efficient Graph Packing via Game Colouring
• Radius two trees specify χ‐bounded classes
• Coloring and Covering Nowhere Dense Graphs
• The Generalised Colouring Numbers on Classes of Bounded Expansion
• Deciding First-Order Properties of Nowhere Dense Graphs
• Testing first-order properties for subclasses of sparse graphs
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Competitive colorings of oriented graphs