1. Agnarsson, G., Greenlaw, R., Halldrsson, M.M.: On powers of chordal graphs and their colorings. Congr. Numer. 144, 41–65 (2000)
2. Agnarsson, G., Halldórsson, M.M.: Coloring powers of planar graphs. SIAM J. Discrete Math. 16(4), 651–662 (2003), also in SODA 2000
3. Alon, N., Mohar, B.: The chromatic number of graph powers. Combinatorics, Probability & Computing 11(1), 1–10 (2002)
4. Barrett, C.L., Istrate, G., Vilikanti, A.K., Marathe, M., Thite, S.V.: Approximation algorithms for distance-2 edge coloring. Tech. rep., Los Alamos National Lab., NM, US (2002)
5. Barrett, C.L., Kumar, V.S.A., Marathe, M.V., Thite, S., Istrate, G.: Strong edge coloring for channel assignment in wireless radio networks. In: PerCom Workshops, pp. 106–110 (2006)