Frugal, acyclic and star colourings of graphs
From MaRDI portal
Publication:643020
DOI10.1016/j.dam.2010.05.008zbMath1228.05153OpenAlexW2070148795MaRDI QIDQ643020
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
graph colouringacyclic colouringfrugal colouringgraphs of bounded maximum degreeimproper colouringstar colouring
Related Items
Unnamed Item ⋮ The complexity of frugal colouring ⋮ Separation dimension and degree ⋮ \(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
This page was built for publication: Frugal, acyclic and star colourings of graphs
