1. Agnarsson, G., Halldórsson, M.M.: Coloring powers of planar graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 654–662 (2000)
2. Lecture Notes in Computer Science;H.L. Bodlaender,2000
3. Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part I: Triangulations (2001) (preprint)
4. Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and bunches in planar graphs. Part II: General planar graphs and colourings (2001) (preprint)
5. Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9, 309–316 (1996)