T-graphs and the channel assignment problem

Discrete Mathematics

Volumn 161, Issue 1-3, 1996, Pages 197-205

  Liu, Daphne Der Fen ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013366311     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365x(95)00225-l     Document Type: Article

References (14)

1. M.B. Cozzens and F.S. Roberts, T-colorings of graphs and the channel assignment problem, Congr. Numer. 35 (1982) 191-208.
2. 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.
3. M.B. Cozzens and D.-I. Wang, The general channel assignment problem, Congr. Numer. 41 (1984) 115-129.
4. J.R. Griggs and D.D.-F. Liu, The channel assignment problem for mutually adjacent sites, J. Combin. Theory, Ser. A 68 (1994) 169-183.
5. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
6. D.D.-F. Liu, T-colorings of graphs, Discrete Math. 101 (1992) 203-212.
7. D.D.-F. Liu, Graph homomorphisms and the channel assignment problem, Ph.D. Dissertation, Department of Mathematics, University of South Carolina, Columbia, SC, 1991.
8. D.D.-F. Liu, On a conjecture of T-colorings, Congr. Numer. 103 (1994) 27-31.
9. J.H. Rabinowitz and V.K. Proulx, An asymptotic approach to the channel assignment problem, SIAM J. Algebraic Discrete Methods 6 (1995) 507-518.
10. A. Raychaudhuri, Intersection assignment, T-colorings, and powers of graphs, Ph.D. Dissertation, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1985.
11. A. Raychaudhuri, Further results on T-coloring and frequency assignment problems, SIAM J. Discrete Math., to appear.
12. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93 (1991) 229-245.
13. B.A. Tesman, T-colorings, list T-colorings, and set T-colorings of graphs, Ph.D. Dissertation, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1989.
14. D.-I. Wang, The Channel assignment problem and closed neighborhood containment graphs, Ph.D. Dissertation, Northeastern University, Boston, MA, 1985.