The acyclic coloring of the Corona product and Edge corona product of special graphs
Qiqi Lu, Shuangliang Tian, Lizhen Peng · 2020
An acyclic coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic coloring of a graph G. We study the acyclic coloring of the corona product, edge corona product of paths or circles and any simple graph, and the corresponding acyclic chromatic number are determined.