Parameterized and Approximation Algorithms for the Load Coloring Problem

Let c ,  k be two positive integers. Given a graph G = ( V , E ) , the c - Load Coloring problem asks whether there is a c -coloring φ : V → [ c ] such that for every i ∈ [ c ] , there are at least k edges with both endvertices colored i . Gutin and Jones (Inf Process Lett 114:446–449, 2014 ) studie...

Full description