Twin-width and generalized coloring numbers
Combinatorics
2021-04-20 v1
Abstract
In this paper, we prove that a graph with no -subgraph and twin-width has -admissibility and -coloring numbers bounded from above by an exponential function of and that we can construct graphs achieving such a dependency in .
Cite
@article{arxiv.2104.09360,
title = {Twin-width and generalized coloring numbers},
author = {Jan Dreier and Jakub Gajarsky and Yiting Jiang and Patrice Ossona de Mendez and Jean-Florent Raymond},
journal= {arXiv preprint arXiv:2104.09360},
year = {2021}
}