1. Aardal KI, Hipolito A, Van Hoesel CPM, Jansen B, Roos C, Terlaky T (1995) A branch-and-cut algorithm for the frequency assignment problem. Technical Report EUCLID CALMA Project, Delft and Eindhoven University of Technology, The Netherlands
2. Bonias I (1991) T-colorings of complete graphs. PhD Thesis, Department of Mathematics, Northeastern University
3. Brelaz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251–256
4. Cozzens MB, Roberts FS (1982) T-colorings of graphs and the channel assignment problem. Congr Numer 35:191–208
5. Cozzens MB, Wang DI (1984) The general channel assignment problem. Congr Numer 41:115–129