The dib-chromatic number of digraphs
We study an extension to directed graphs of the parameter called the $b$-chromatic number of a graph in terms of acyclic vertex colorings: the dib-chromatic number. We give general bounds for this parameter. We also show some results about tournaments and regular digraphs.
math.CO↗