New Bounds for the Dichromatic Number of a Digraph

Narda Cordero-Michel, Hortensia Galeana-Sánchez

The chromatic number of a graph $G$, denoted by $\chi (G)$, is the minimum $k$ such that $G$ admits a $k$-coloring of its vertex set in such a way that each color class is an independe…