A note on acyclic vertex-colorings
Note sur la coloration acyclique des sommets d'un graphe
Résumé
We prove that the acyclic chromatic number of a graph with maximum degree ∆ is less than 2.835∆4/3+∆. This improves the previous upper bound, which was 50∆4/3. To do so, we draw inspiration from works by Alon, McDiarmid and Reed and by Esperet and Parreau.
Domaines
Combinatoire [math.CO]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...