Two-Class (r,k)-Coloring: Coloring with Service Guarantees

Pál András Papp, Roland Schmid, Valentin Stoppiello +1

This paper introduces the Two-Class ($r$,$k$)-Coloring problem: Given a fixed number of $k$ colors, such that only $r$ of these $k$ colors allow conflicts, what is the minimal numb…