The Diachromatic Number of Digraphs

• DOI: 10.37236/7807
• Publication Date: 2020-01-10T10:09:52Z
• Authors: Gabriela Araujo-P...; Juan José Montell...; Mika Olsen; Christian Rubio-M...
• Keywords: Digraph; Greedy coloring; Brooks' theorem; Achromatic lens; Edge Coloring; Complete coloring; Fractional coloring

We consider the extension to directed graphs of concept achromatic number in terms acyclic vertex colorings. The have been intensely studied since it was introduced by Harary, Hedetniemi and Prins 1967. dichromaticnumber is a generalization chromatic for digraphs defined Neumann-Lara 1982. A coloring digraph an if each subdigraph induced class acyclic, complete any pair classes $x,y$, there arc from $x$ $y$ $x$. dichromatic diachromatic numbers are, respectively, smallest largest colors coloring. give some general results study tournaments. also show that interpolation property colorings does hold establish Nordhaus-Gaddum relations.