For an edge-colored graph, writing down the explicit transition graphs may
result in a non-linear increase in size. A linear-time algorithm for finding a
properly colored trail between two given vertices of an edge-colored graph is
given in [1]}.
