Twin-width and generalized coloring numbers

Twin-width and generalized coloring numbers

In this paper, we prove that a graph G with no Ks,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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2022-03, Vol.345 (3), p.112746, Article 112746
Hauptverfasser: Dreier, Jan, Gajarský, Jakub, Jiang, Yiting, Ossona de Mendez, Patrice, Raymond, Jean-Florent
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Computer Science
Discrete Mathematics
Generalized coloring numbers
Mathematics
Twin-width
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we prove that a graph G with no Ks,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.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2021.112746