  We prove that when a digraph $G$ has a Maltsev polymorphism, then $G$ also
has a majority polymorphism. We consider the consequences of this result for
the structure of Maltsev graphs and the complexity of the Constraint
Satisfaction Problem.
