Frugal, acyclic and star colourings of graphs

DOI10.1016/j.dam.2010.05.008zbMath1228.05153MaRDI QIDQ643020

Ross J. Kang, Tobias Müller

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.008

zbMATH Keywords

graph colouring; acyclic colouring; frugal colouring; graphs of bounded maximum degree; improper colouring; star colouring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

\(k\)-forested choosability of planar graphs and sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear choosability of graphs
• Acyclic improper colourings of graphs with bounded maximum degree
• Asymptotically optimal frugal colouring
• Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)]
• On acyclic colorings of planar graphs
• Colouring a graph frugally
• Linear coloring of graphs
• On the injective chromatic number of graphs
• A unified approach to distance-two colouring of graphs on surfaces
• Star coloring of graphs
• Acyclic coloring of graphs
• Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
• The Chromatic Number of Graph Powers
• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
• Acyclic dominating partitions
• Acyclic colorings of planar graphs
• Graph colouring and the probabilistic method