Colorful Cycle Problem

The colorful cycle problem is the algorithmic problem of deciding whether a graph whose vertices are colored with colors 1, ..., contains a simple -cycle using each color exactly once. Such a cycle is called a colorful cycle by Panolan and Zehavi (2016).

The problem is closely related to the color coding method of Alon et al. (1995), in which random vertex colorings are used to search for small subgraphs with prescribed color patterns.