We show that it is, again, part of our family of equivalent problems; more
precisely compatible trails can be found with time complexity linear in
the number of allowed transitions (compatible-trail). The
associated structural result (forbidden-transition-bridge) entails, as a
corollary, a new proof of the one for properly colored
trails [1]}.
