Cheng–Kano–Wang conjecture on PC Hamilton paths in balanced bipartite graphs

Let $K_{n,n}$ be an edge-colored complete balanced bipartite graph. A PC 1-path-cycle factor is a PC spanning subgraph that is the union of a PC path and a number of PC cycles.

Cheng–Kano–Wang conjecture. If $K_{n,n}$ contains a PC 1-path-cycle factor, then $K_{n,n}$ contains a PC Hamilton path.

This is presented as the balanced bipartite analogue of the PC 1-path-cycle factor result for edge-colored complete graphs. The supplied text gives no resolution.