  Arrangements of pseudolines are a widely studied generalization of line
arrangements. They are defined as a finite family of infinite curves in the
Euclidean plane, any two of which intersect at exactly one point. One can state
various related coloring problems depending on the number $n$ of pseudolines.
In this article, we show that $n$ colors are sufficient for coloring the
crossings avoiding twice the same color on the boundary of any cell, or,
alternatively, avoiding twice the same color along any pseudoline. We also
study the problem of coloring the pseudolines avoiding monochromatic crossings.
