A note on acyclic vertex-colorings
Combinatorics
2013-12-20 v1
Abstract
We prove that the acyclic chromatic number of a graph with maximum degree is less than . This improves the previous upper bound, which was . To do so, we draw inspiration from works by Alon, McDiarmid and Reed and by Esperet and Parreau.
Keywords
Cite
@article{arxiv.1312.5600,
title = {A note on acyclic vertex-colorings},
author = {Jean-Sébastien Sereni and Jan Volec},
journal= {arXiv preprint arXiv:1312.5600},
year = {2013}
}