Weak coloring numbers of minor-closed graph classes

DOI10.1137/1.9781611978322.107MaRDI QIDQ7289679zbMATH OpenFDO

Authors Jçdrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.107

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Treedepth and 2-treedepth in graphs with no long induced paths

This page was built for publication: Weak coloring numbers of minor-closed graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289679)