1. I. Bonias, T-colorings of complete graphs, Ph.D. Thesis, Northeastern University, Boston, MA, 1991.
2. T-colorings of graphs and the channel assignment problem;Cozzens;Congr. Numer.,1982
3. Interference-minimizing colorings of regular graphs;Fishburn;SIAM J. Discrete Math.,1998
4. The channel assignment problem for mutually adjacent sites;Griggs;J. Combin. Theory,1994
5. No-hole k-tuple (r+1)-distant colorings of odd cycles;Guichard;Discrete Appl. Math.,1996