Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough
Résumé
An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two neighbors in G are assigned the same color and (ii) no bicolored cycle can exist in G. The acyclic chromatic number of G is the least number of colors necessary to acyclically color G. In this paper, we show that any graph of maximum degree 5 has acyclic chromatic number at most 9, and we give a linear time algorithm that achieves this bound.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...