Maximum cuts in edge-colored graphs

Luerbio Faria, Sulamita Klein, Ignasi Sau +2

The input of the Maximum Colored Cut problem consists of a graph $G=(V,E)$ with an edge-coloring $c:E\to \{1,2,3,\dots ,p\}$ and a positive integer $k$, and the question is wheth…