References
- N. Alon and B. Mohar, The chromatic number of graph powers, Combin. Probab. Comput., 11 (2002), 1–10.
- G. Fertin, E. Godard, and A. Raspaud, Acyclic and k-distance coloring of the grid, Inform. Process. Lett., 87 (2003), 51–58.
- G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs, Lecture Notes in Computer Science., 2204 (2001), 140–153.
- D.S. Kim, D.Z. Du, and P.M. Pardalos, A coloring problem on the n-cube, Discrete Appl. Math., 103 (2002), 307–311.
- P.J. Wan, Near-optimal conflict-free channel set assignments for an optical cluster-based bypercube network, J. Combin. Optim., 1 (1997), 179–186.