Corollary 4.13 ([1]}) 

Let \(G\)  be an edge-colored graph such that every vertex of \(G\)  is incident
with at least two differently colored edges. Then, if \(G\)  does not have a
properly colored closed trail, then \(G\)  has a bridge.

