  Mixed graphs can be seen as digraphs that have both arcs and edges (or
digons, that is, two opposite arcs). In this paper, we consider the case where
such graphs are bipartite. As main results, we show that in this context the
Moore-like bound is attained in the case of diameter $k=3$, and that bipartite
mixed graphs of diameter $k\ge 4$ do not exist.
