A note on the rainbow cycle cover problem
Jorge Moreno, Simone de Lima Martins, Yuri Alexandre Rodrigues Frota · Networks · 2018
Abstract Given an edge‐colored graph G, a cycle with all its edges with different colors is called a rainbow cycle. The rainbow cycle cover (RCC) problem consists of finding the minimum number of disjoint rainbow cycles covering G. We present an integer linear programming model for the RCC problem and a reduction process for decreasing the dimensions of the graph, resulting in a more efficient method that was able to find new optimal solutions for instances that were unsolved.