Colour Number, Capacity, and Perfectness of Directed Graphs
- 56 Downloads
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.
KeywordsDirected Graph Chromatic Number Clique Number Common Generalization Colour Number
Unable to display preview. Download preview PDF.