Abstract.
We introduce a new concept of chromatic number for directed graphs, called the colour number and use it to upper bound the transitive clique number and the Sperner capacity of arbitrary directed graphs. Our results represent a common generalization of previous bounds of Alon and the second author and lead to a concept of perfectness for directed graphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Revised: June 3, 1998
Rights and permissions
About this article
Cite this article
Fachini, E., Körner, J. Colour Number, Capacity, and Perfectness of Directed Graphs. Graphs Comb 16, 389–398 (2000). https://doi.org/10.1007/PL00007226
Issue Date:
DOI: https://doi.org/10.1007/PL00007226