Skip to main content
Log in

Colour Number, Capacity, and Perfectness of Directed Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Revised: June 3, 1998

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007226

Keywords