References
- Hale , W. K. Frequency assignment . Proceedings of the IEEE 68 . pp. 1497 – 1514 .
- Havet , F. 2001 . Channel assignment and multicoloring of the induced subgraphs of the triangular lattice . Discrete Math. , 233 : 219 – 231 .
- Havet , F. and Žerovnik , J. 2002 . Finding a five bicolouring of a triangle-free subgraph of the triangular lattice . Discrete Math. , 244 : 103 – 108 .
- Janssen , J. , Krizanc , D. , Narayanan , L. and Shende , S. 2000 . Distributed online frequency assignment in cellular networks . J. Algorithms , 36 : 119 – 151 .
- McDiarmid , C. and Reed , B. 2000 . Channel assignment and weighted colouring . Networks , 36 : 114 – 117 .
- Narayanan , L. and Shende , S. 2001 . Static frequency assignment in cellular networks . Algorithmica , 29 : 396 – 410 . (Earlier version in Sirocco 97, (Proceedings of the 4th International Colloquium on structural information and communication complexity, Ascona, Switzerland), D. Krizanc and P. Widmayer, eds., Carleton Scientific, 1997, pp. 215–227)
- Narayanan , L. and Shende , S. 2002 . Corrigendum to static frequency assignment in cellular networks . Algorithmica , 32 : 697
- Šparl , P. , Ubeda , S. and Žerovnik , J. 2002 . Upper bounds for the span of frequency plans in cellular networks . Int. J. Appl. Math. , 9 ( 2 ) : 115 – 139 .
- Šparl , P. and Žerovnik , J. 2004 . 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs . Inf. Process. Lett. , 90 : 239 – 246 .
- Šparl , P. and Žerovnik , J. 2005 . 2-Local 4/3-competitive algorithm for multicoloring hexagonal graphs . J. Algorithms , 55 : 29 – 41 .
- Sudep , K. S. and Vishwanathan , S. 2005 . A technique for multicoloring triangle-free hexagonal graphs . Discrete Math. , 300 : 256 – 259 .
- Ubeda , S. and Žerovnik , J. Upper bounds for the span of triangular lattice graphs: application to frequency planing for cellular networks . Research rep. 97-28, ENS Lyon, September 1997
- Žerovnik , J. 2006 . A distributed 6/5-competitive algorithm for multicoloring triangle-free hexagonal graphs . Int. J. Pure Appl. Math. , 33 ( 2 ) : 141 – 156 .