T-colorings of graphs: recent results and open problems

Discrete Mathematics

Volumn 93, Issue 2-3, 1991, Pages 229-245

  Roberts, Fred S ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013110657     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(91)90258-4     Document Type: Article

References (54)

1. Optimal assignment of broadcasting frequencies
2. Spectrum-efficient frequency assignment in mixed service bands
3. The spectrum cost of frequency-distance separation rules
4. Applications of numbered, undirected graphs
5. Numbered complete graphs, unusual rulers, and assorted applications
6. On covering the points of a graph with point disjoint paths
7. List colourings of graphs
8. T-Colorings of complete graphs
9. On the bandwidths of a graph and its complement
10. Perfectly Ordered Graphs
11. On the bandwidth problem for graphs
12. Double semiorders and double indifference graphs
13. T-Colorings of graphs and the channel assignment problem
14. Greedy algorithms for T -colorings of complete graphs and the meaningfulness of conclusions about them
15. The general channel assignment problem
16. Threshold representations of multiple semiorders
17. Choosability in graphs
18. Pair labellings with given distance
19. On the Hamiltonian completion problem
20. The ellipsoid method and its consequences in combinatorial optimization
21. Frequency assignment: theory and applications
22. Frequency assignment methodology: an annotated bibliography
23. Spectrum efficiency as a function of frequency-distance rules: an application to UHF-TV
24. New spectrum management tools
25. The combinatorial distance geometry approach to the calculation of molecular conformation
26. The combinatorial distance geometry approach to the calculation of molecular conformation I: A new approach to an old problem
27. The combinatorial distance geometry approach to the calculation of molecular conformation II: Sample problems and computational statistics
28. A frequency assignment scenario
29. Radio frequency assignment and graph coloring
30. Graph homomorphisms and the channel assignment problem
31. Space graphs and sphericity
32. Spectrum management technique
33. On the complexity of recognizing perfectly orderable graphs
34. UHF taboos—history and development
35. On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems
36. Optimal allocation of TV channels—a feasibility study
37. An asymptotic approach to the channel assignment problem
38. Intersection assignments, T -coloring, and powers of graphs
39. Graph theory and its applications to problems of society
40. On the mobile radio frequency assignment problem and the traffic light phasing problem
41. From garbage to rainbows: generalizations of graph colorings and their applications
42. Graph colouring and frequency assignment
43. n-tuple colorings and associated graphs
44. T-colorings, list T-colorings, and set T-colorings of graphs
45. Applications of forbidden difference graphs to T -coloring
46. Set T-colorings
47. The channel assignment problem and closed neighborhood containment graphs
48. Frequency assignment games and strategies
49. A breakthrough in spectrum conserving frequency assignment technology