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

Abstract

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… (More)
DOI: 10.1016/j.endm.2015.06.072

Topics

2 Figures and Tables

Slides referencing similar topics