Color degree and alternating cycles in edge-colored graphs

Let G be an edge-colored graph. An alternating cycle of G is a cycle of G in which any two consecutive edges have distinct colors. Let d c ( v ) , the color degree of a vertex v , be defined as the maximum number of edges incident with v that have distinct colors. In this paper, we study color degree conditions for the existence of alternating cycles of prescribed length.