Twin-width and generalized coloring numbers

Jan Dreier, Jakub Gajarsky, Yiting Jiang +2

In this paper, we prove that a graph $G$ with no $K_{s,s}$-subgraph and twin-width $d$ has $r$-admissibility and $r$-coloring numbers bounded from above by an exponential function…