Graph covers using t-colourable vertex sets Original Research Article

A t-chrome cover is a cover of a weighted graph by vertex sets that induce t-colourable subgraphs. We investigate the problem of determining the minimal number of sets needed for such a cover, and give conditions under which this number is directly derived from the clique number and the maximum weight of the graph. The problem of minimal t-chrome covers is relevant to frequency assignment in cellular networks.