Coloring digraphs by iterated antichains
Svatopluk Poljak · Czech digital mathematics library · 1991
summary: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.