Answers are grounded in this paper and cite their sources.
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees.The purpose of this paper is to derive exact values of acyclic chromatic number of some graphs.
No takes yet. Share an insight, caveat, or question.
Babu et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: