In 1978, Chvátal and Thomassen proved that each bridgeless undirected graph G has an orientation with radius at most \(rad(G)^2+rad(G)\) . In 1985, Chung, Garey, and Tarjan extended the work of Chvátal and Thomassen to mixed graphs, and proved that each bridgeless mixed graph G has an orientation with radius at most \(4rad(G)^2+4rad(G)\) . Recently, Czabarka, Dankelmann, and Székely determined the minimum degree threshold for an undirected graph of order n to have oriented diameter two. Chen and Chang gave a sufficient condition regarding the minimum degree for an undirected bipartite graph to have oriented diameter three, and determined the minimum degree threshold for such a graph to have oriented diameter three. In this paper, we extend the work of Chen and Chang to mixed graphs, and give a sufficient condition regarding the minimum degree for a mixed bipartite graph to have oriented diameter three. In particular, we established a sufficient bound and provided constructions showing that the bound is close to best possible.
