On the complexity of k-rainbow cycle colouring problems

Shasha Li, Yongtang Shi, Jianhua Tu +1

An edge-coloured cycle is $rainbow$ if all edges of the cycle have distinct colours. For $k\ge 1$, let ${\mathcal{F}}_k$ denote the family of all graphs with the property that any…