Acyclic improper colourings of graphs with bounded maximum degree

DOI10.1016/j.disc.2008.09.009zbMath1185.05056OpenAlexW2122813432MaRDI QIDQ960917

Alexandre Pinlou, Louis Esperet, Ross J. Kang, Louigi Addario-Berry, Colin J. H. McDiarmid

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.009

zbMATH Keywords

bounded degree graphsacyclic colouringimproper colouringstar colouringbounded maximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Acyclic colorings of graphs with bounded degree ⋮ Frugal, acyclic and star colourings of graphs ⋮ Acyclic dominating partitions ⋮ Acyclic improper choosability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Star coloring of graphs
• The t-improper chromatic number of random graphs
• Acyclic coloring of graphs
• Acrylic improper colorings of graphs
• Acyclic colorings of planar graphs
• Graph colouring and the probabilistic method

This page was built for publication: Acyclic improper colourings of graphs with bounded maximum degree