  Mixed graphs have both directed and undirected edges. A mixed cage is a
regular mixed graph of given girth with minimum possible order. In this paper
mixed cages are studied. Upper bounds are obtained by general construction
methods and computer searches.
