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. Andreou, M., Spirakis, P.G.: Efficient colouring squares of planar graphs (2003) (preprint)
3. Appel, K., Haken, W.: Every planar map is four colourable. Part I: Discharging. Illinois J. Math. 21, 429–490 (1977)
4. Appel, K., Haken, W., Koch, J.: Every planar map is four colourable. Part II: Reducibility. Illinois J. Math. 21, 491–567 (1977)
5. Lecture Notes in Computer Science;H.L. Bodlaender,2002