The acyclic coloring of the Direct product and Semi-strong product of special graphs
Qiqi Lu, Shuangliang Tian, Lizhen Peng · 2021
An acyclic coloring of a graph is a proper vertex coloring without dichromatic 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 direct product, semi-strong product of paths and stars, and the corresponding acyclic chromatic number are determined.