On Colored Edge Cuts in Graphs
Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens A. Sucupira · 2016
In this work we present some results on the classical and parameterized complexity of finding cuts in edge-colored graphs. In general, we are interested in problems of finding cuts {A,B} which minimize or maximize the number of colors occurring in the edges with exactly one endpoint in A.