Weak coloring numbers of minor-closed graph classes - Laboratoire Interdisciplinaire des Sciences du Numérique
Pré-Publication, Document De Travail Année : 2024

Weak coloring numbers of minor-closed graph classes

Résumé

We study the growth rate of weak coloring numbers of graphs excluding a fixed graph as a minor. Van den Heuvel et al. (European J. of Combinatorics, 2017) showed that for a fixed graph $X$, the maximum $r$-th weak coloring number of $X$-minor-free graphs is polynomial in $r$. We determine this polynomial up to a factor of $\mathcal{O}(r \log r)$. Moreover, we tie the exponent of the polynomial to a structural property of $X$, namely, $2$-treedepth. As a result, for a fixed graph $X$ and an $X$-minor-free graph $G$, we show that $\mathrm{wcol}_r(G)= \mathcal{O}(r^{\mathrm{td}(X)-1}\mathrm{log}\ r)$, which improves on the bound $\mathrm{wcol}_r(G) = \mathcal{O}(r^{g(\mathrm{td}(X))})$ given by Dujmović et al. (SODA, 2024), where $g$ is an exponential function. In the case of planar graphs of bounded treewidth, we show that the maximum $r$-th weak coloring number is in $\mathcal{O}(r^2\mathrm{log}\ r$), which is best possible.
Fichier principal
Vignette du fichier
2407.04588v1.pdf (1.44 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04819269 , version 1 (04-12-2024)

Licence

Identifiants

Citer

Jȩdrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud. Weak coloring numbers of minor-closed graph classes. 2024. ⟨hal-04819269⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More