1. Hahn G., Kratochvíl J., Širáň J., and Sotteau D., “On the injective chromatic number of graphs,” Discrete Math., 256,No. 1–2, 179–192 (2002).
2. Wegner G., Graphs with Given Diameter and a Coloring Problem, Technical Report, Univ. of Dortmund, Germany (1977).
3. Agnarsson G. and Halldorsson M. M., “Coloring powers of planar graphs,” SIAM J. Discrete Math., 16, No. 4, 651–662 (2003).
4. Borodin O. V., Broersma H. J., Glebov A. N., and van den Heuvel J., “The structure of plane triangulations in terms of stars and bunches,” Diskret. Anal. Issled. Oper., 8, No. 2, 15–39 (2001).
5. Borodin O. V., Broersma H. J., Glebov A. N., and van den Heuvel J., “The minimum degree and chromatic number of the square of a planar graph,” Diskret. Anal. Issled. Oper., 8, No. 4, 9–33 (2001).