1 Answers
In graph theory, an acyclic coloring is a vertex coloring in which every 2-chromatic subgraph is acyclic. The acyclic chromatic number A of a graph G is the fewest colors needed in any acyclic coloring of G.
Acyclic coloring is often associated with graphs embedded on non-plane surfaces.
4 views
Answered