Acyclic improper colourings of graphs with bounded maximum degree

For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour classes is acyclic, and each colour class induces a graph with maximum degree at most t. We consider the supremum, over all...

Full description

Bibliographic Details
Main Authors: Addario-Berry, L, Esperet, L, Kang, R, McDiarmid, C, Pinlou, A
Format: Journal article
Language:English
Published: 2010