Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/S0012-365X(03)00246-2 | Discrete Mathematics |
Keywords | DocType | Volume |
Graph colouring,Perfect graphs,Box perfection,Frequency assignment | Journal | 278 |
Issue | ISSN | Citations |
1 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylvain Gravier | 1 | 486 | 59.01 |
| Jeannette Janssen | 2 | 295 | 32.23 |
| Kyriakos Kilakos | 3 | 21 | 3.97 |
| Sulamita Klein | 4 | 308 | 32.86 |