Acyclic Coloring of 5‐regularless Graphs with Maximum Degree 5 with Seven Colors
Ahmad Salehi‐Zarrin‐Ghabaei, Reza Rostami · AIP conference proceedings · 2010
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 5‐regularless graph with Δ = 5 has acyclic chromatic number at most 7.