Rainbow cycles in edge-colored graphs

• Published in: Discrete mathematics Vol. 339; no. 4; pp. 1387 - 1392
• Main Authors: Čada, Roman, Kaneko, Atsushi, Ryjáček, Zdeněk, Yoshimoto, Kiyoshi
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 06.04.2016
• Subjects: Color; Color degree condition; Coloring; Edge coloring; Graph theory; Graphs; Integers; Mathematical analysis; Rainbow coloring; Rainbow cycle; Rainbows; Color degree condition; Rainbow cycle; Rainbow coloring; Edge coloring

Let G be a graph of order n with an edge coloring c, and let δc(G) denote the minimum color degree of G, i.e., the largest integer such that each vertex of G is incident with at least δc(G) edges having pairwise distinct colors. A subgraph F⊂G is rainbow if all edges of F have pairwise distinct colo...