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...
Main Authors: | Addario-Berry, L, Esperet, L, Kang, R, McDiarmid, C, Pinlou, A |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|
Similar Items
-
The t-Improper Chromatic Number of Random Graphs
by: Kang, R, et al.
Published: (2010) -
The t-improper chromatic number of random graphs
by: Kang, R, et al.
Published: (2008) -
Improper colourings of graphs
by: Kang, R
Published: (2008) -
On the Maximum Degree of a Random Planar Graph.
by: McDiarmid, C, et al.
Published: (2008) -
Colour degree matrices of graphs with at most one cycle
by: Hillebrand, A, et al.
Published: (2015)