  We prove that deciding whether the edge set of a graph can be partitionned
into two spanning trees with orientation constraints is NP-complete. If P
$\neq$ NP then this disproves a conjecture of Recski.
