Distance graphs and the T-coloring problem

Discrete Mathematics

Volumn 196, Issue 1-3, 1999, Pages 153-166

  Gräf, Albert ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 9344261400     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00199-X     Document Type: Article

References (14)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, Proc. 33rd Ann. IEEE Symp. on the Foundations of Computer Science, 1992, pp. 14-23.
2. I. Bonias, T-colorings of complete graphs, Ph.D. Thesis, Northeastern University, Department of Mathematics, Boston, MA, 1991.
3. D.G. Cantor, B. Gordon, Sequences of integers with missing differences, J. Combin. Theory Ser. A 14 (1973) 281-287.
4. M. Cozzens, F. Roberts, Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them, manuscript, Department of Mathematics and Center for Operations Research, Rutgers University, New Brunswick, NJ, April 1991.
5. R.B. Eggleton, P. Erdös, D.K. Skilton, Colouring the real line, J. Combin. Theory Ser. B 39 (1985) 86-100.
6. M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
7. J.R. Griggs, D.D.-F. Liu, The channel assignment problem for mutually adjacent sites, manuscript, Department of Mathematics, University of South Carolina, Columbia, 1992.
8. H. Halberstam, K. Roth, Sequences, vol. I, Oxford University Press, Oxford 1966.
9. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
10. K. Jansen, A rainbow about T-colorings for complete graphs, Discrete Math. 154 (1996) 129-139.
11. F. Krückeberg, B2-Folgen und verwandte Zahlenfolgen, J. Reinen Angewandten Mathematik 206 (1961) 53-60.
12. D.D.-F. Liu, T-colorings of graphs, Discrete Math. 101 (1992) 203-212.
13. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93 (1991) 229-245.
14. M. Voigt, On the chromatic number of distance graphs, J. Inform. Process. Cybernet. EIK 28 (1) (1992) 21-28.