Destroying Multicolored Paths and Cycles in Edge-Colored Graphs

Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz +1

We study the computational complexity of $c$-Colored $P_{\ell }$ Deletion and $c$-Colored $C_{\ell }$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to dest…