A rainbow about T-colorings for complete graphs

Discrete Mathematics

Volumn 154, Issue 1-3, 1996, Pages 129-139

  Jansen, Klaus ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345846266     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00344-I     Document Type: Article

References (12)

1. I. Bonias, T-colorings of complete graphs, Ph.D. thesis, Department of Mathematics, Northeastern University, Boston, MA, 1991.
2. M.B. Cozzens and F.S. Roberts, T-colorings of graphs and the channel assignment problem, Congress Numer. 35 (1982) 191-208.
3. M.B. Cozzens and F.S. Roberts, Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them, J. Combin. Inform. System Sci. 16 (1991) 286-299.
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
5. A. Gräf, Complete difference sets and T-colorings of complete graphs, Bericht, Universität Mainz, 7 (1993).
6. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
7. D.D. Liu, Graph homomorphisms and the channel assignment problem, Ph.D. thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1991.
8. A. Rayachaudhuri, Optimal multiple interval assignments in frequency assignment and traffic phasing, Discrete Appl. Math. 40 (1992) 319-332.
9. F.S. Roberts, From garbage to rainbows: Generalizations of graph colorings and their applications, in: Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk, eds., Graph Theory, Combinatorics, and Applications, Vol. 2 (Wiley, New York, 1991) 1031-1052.
10. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93 (1991) 229-245.
11. B. Tesman, T-colorings, list T-colorings, and set T-colorings of graphs. Ph.D. thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, October 1989.
12. D.-I. Wang, The channel assignment problem and closed neighborhood containment graphs, Ph.D. thesis, Northeastern University, Boston, MA, 1985.