On Beck’s coloring of posets

We study Beck-like coloring of partially ordered sets (posets) with a least element 0. To any poset P with 0 we assign a graph (called a zero-divisor graph) whose vertices are labelled by the elements of P with two vertices x , y adjacent if 0 is the only element lying below x and y . We prove that for such graphs, the chromatic number and the clique number coincide. Also, we give a condition under which posets are not finitely colorable.