Improper Coloring of Weighted Grid and Hexagonal Graphs


We study a weighted improper colouring problem motivated by a frequency allocation problem. It consists of associating to each vertex a set of p(v) (weight) distinct colours (frequencies), such that the set of vertices having a given colour induces a graph of degree at most k (the case k = 0 corresponds to a proper coloring). The objective is to minimize… (More)
DOI: 10.1142/S1793830910000747

7 Figures and Tables


  • Presentations referencing similar topics