The Generalised Colouring Numbers on Classes of Bounded Expansion

DOI10.4230/LIPIcs.MFCS.2016.85zbMath1398.05089arXiv1606.08972MaRDI QIDQ4608648

Sebastian Siebertz, Michał Pilipczuk, Roman Rabinovich, Stephan Kreutzer

Publication date: 21 March 2018

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

zbMATH Keywords

splitter gamegeneralised colouring numbersnowhere dense graphsgraph structure theoryfirst-order model-checking

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Unnamed Item ⋮ Uniform orderings for generalized coloring numbers ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

This page was built for publication: The Generalised Colouring Numbers on Classes of Bounded Expansion