Theorem 6.4 ([1]}) 
Deciding whether a 2-arc-colored digraph contains a properly colored path
between two given vertices is \(\mathsf {NP}\) -complete, even when the input is
restricted to digraphs with no properly colored circuit.

