Bounding generalized coloring numbers of planar graphs using coin models

DOI10.37236/11095arXiv2201.09340MaRDI QIDQ6199193

Karol Węgrzycki, Michał Pilipczuk, Jesper Nederlof

Publication date: 23 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Koebe orderingsweak \(d\)-coloring number

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Generalization of transitive fraternal augmentations for directed graphs and its applications
• Colouring graphs with bounded generalized colouring number
• Characterising bounded expansion by neighbourhood complexity
• Orderings on graphs and game coloring number
• Constant-factor approximation of the domination number in sparse graphs
• Improved bounds for weak coloring numbers
• Clustering powers of sparse graphs
• Nowhere dense graph classes and dimension
• Sublinear Separators in Intersection Graphs of Convex Shapes
• Neighborhood complexity and kernelization for nowhere dense classes of graphs
• Parameterized circuit complexity of model-checking on sparse structures
• Erdös--Hajnal Properties for Powers of Sparse Graphs
• On low rank-width colorings
• On the generalised colouring numbers of graphs that exclude a fixed minor
• Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes

This page was built for publication: Bounding generalized coloring numbers of planar graphs using coin models