We discuss bounds for and algorithmic aspects of the chromatic number
of diagrams. In particular we investigate the chromatic number of diag
rams of special classes of posets such as semi-orders, series-parallel
orders, N-free orders and interval orders.