Acyclic improper colourings of graphs with bounded maximum degree

Abstract

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

Topics

1 Figure or Table

Slides referencing similar topics