Svatopluk Poljak
Coloring digraphs by iterated antichains

Comment.Math.Univ.Carolinae 32,2 (1991) 209-212.

Abstract:We show that the minimum chromatic number of a product of two $n$-chromatic graphs is either bounded by 9, or tends to infinity. The result is obtained by the study of coloring iterated adjoints of a digraph by iterated antichains of a poset.

Keywords: graph product, chromatic number, antichain
AMS Subject Classification: 05C15, 06A10