Sciweavers

Share
DM
2010

Acyclic improper colourings of graphs with bounded maximum degree

9 years 10 months ago
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 graphs of maximum degree at most d, of the acyclic t-improper chromatic number and provide t-improper analogues of results by Alon, McDiarmid and Reed (1991, RSA 2(3), 277
Louigi Addario-Berry, Louis Esperet, Ross J. Kang,
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where DM
Authors Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
Comments (0)
books