Approximating maximum properly colored forests via degree bounded independent sets

Yuhang Bai, Kristóf Bérczi, Johanna K. Siemelink

In the Maximum-size Properly Colored Forest problem, we are given an edge-colored undirected graph and the goal is to find a properly colored forest with as many edges as possible.…