On the chromatic number of digraphs
Presented by Bojan MOHAR
Type: Oral presentation
Track: Coloring of Graphs
Several reasons will be presented why the natural extension of the notion of undirected graph colorings is to partition the vertex set of a digraph into acyclic sets. Some recent results in this area, the proofs of which use probabilistic techniques, will be outlined.