According to this [link](http://www.princeton.edu/~sspirkl/openproblems.html) (see point $15$), Matt DeVos and David Wood can prove that every digraph in which each vertex has an out-neighbour has a good $4$-colouring (I am using their terminology).