Twin-width and generalized coloring numbers
Résumé
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 of $r$ and that we can construct graphs achieving such a dependency in $r$.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
