A classical theorem independently due to Gallai and Roy states that a graph G has a proper k-coloring if and only if G has an orientation without coherent paths of length k. An analogue of this result for signed graphs is proved in this article. Keywords: signed graph; signed-graph coloring; orientation; bidirection. 2020 Mathematics Subject Classification: 05C15, 05C22, 05C20.