On the generalised colouring numbers of graphs that exclude a fixed minor

• Published in: European journal of combinatorics Vol. 66; pp. 129 - 144
• Main Authors: van den Heuvel, Jan, de Mendez, Patrice Ossona, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01-12-2017; Elsevier
• Subjects: Combinatorics; Mathematics
• DOI: 10.1016/j.ejc.2017.06.019
• EISSN: 1095-9971
• ISSN: 0195-6698

The generalised colouring numbers colr(G) and wcolr(G) were introduced by Kierstead and Yang as a generalisation of the usual colouring number, and have since then found important theoretical and algorithmic applications.
In this paper, we dramatically improve upon the known upper bounds for generalised colouring numbers for graphs excluding a fixed minor, from the exponential bounds of Grohe et al. to a linear bound for the r-colouring number colr and a polynomial bound for the weak r-colouring number wcolr. In particular, we show that if G excludes  Kt as a minor, for some fixed t≥4, then colr(G)≤t−12(2r+1) and wcolr(G)≤r+t−2t−2(t−3)(2r+1)∈O(rt−1).
In the case of graphs G of bounded genus g, we improve the bounds to colr(G)≤(2g+3)(2r+1) (and even colr(G)≤5r+1 if g=0, i.e. if G is planar) and wcolr(G)≤(2g+r+22)(2r+1).