Acyclic Coloring of Products of Digraphs and of Digraphs with Bounded Treewidth

I. L. Costa, A. S. F. Silva

The dichromatic number of a digraph $G$ is the smallest integer ${\chi }_a(G)$ such that the vertex set of $G$ can be partitioned into ${\chi }_a(G)$ sets, each of which induces an acyclic sub…