A P3⃗-decomposition of tournaments and bipartite digraphs

A P3⃗-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. In this paper, we give a characterization for a tournament and a bipartite digraph admitting a P3⃗-decomposition. This solves a problem posed by Diwan (2016).