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...
Autors principals: | Addario-Berry, L, Esperet, L, Kang, R, McDiarmid, C, Pinlou, A |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2010
|
Ítems similars
-
Acyclic colourings of graphs with bounded degree
per: Mieczyslaw Borowiecki, et al.
Publicat: (2010-01-01) -
The t-Improper Chromatic Number of Random Graphs
per: Kang, R, et al.
Publicat: (2010) -
The t-improper chromatic number of random graphs
per: Kang, R, et al.
Publicat: (2008) -
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
per: Fiedorowicz Anna
Publicat: (2013-03-01) -
Colour degree matrices of graphs with at most one cycle
per: Hillebrand, A, et al.
Publicat: (2015)