1. Agnarsson G, Halldórsson MM (2000) Coloring powers of planar graphs. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, pp 654–662
2. Bodlaender HL, Kloks T, Tan RB, van Leeuwen J (2000) Approximations for λ $$ { \lambda } $$ -coloring of graphs. In: Proceedings of the 17th annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 1770. Springer, pp 395–406
3. Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12):1497–1514
4. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman
5. Fotakis D, Nikoletseas S, Papadopoulou V, Spirakis P (2000) NP completeness results and efficient approximations for radiocoloring in planar graphs. In: Proceedings of the 25th international symposium on mathematical foundations of computer science. Lecture notes of computer science, vol 1893. Springer, pp 363–372