Multicoloring Planar Graphs and Partial k-Trees

We study graph multicoloring problems, motivated by the scheduling of dependent jobs on multiple machines. In multicoloring problems, vertices have lengths which determine the number of colors they must receive, and the desired coloring can be either contiguous (non-preemptive schedule) or arbitrary (preemptive schedule). We consider both the sum-of… CONTINUE READING