On colorings and orientations of signed graphs

Abstract

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.