We study colorings of quasiordered sets (qosets) with a least element 0. To any qoset we assign a graph (called a zerodivisor graph) and we prove that for such graphs, the chromatic number and the clique number coincide.
We study colorings of quasiordered sets (qosets) with a least element 0. To any qoset we assign a graph (called a zerodivisor graph) and we prove that for such graphs, the chromatic number and the clique number coincide. (en)