A rainbow about T-colorings for complete graphs

  • Klaus Jansen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


Given a finite set T of positive integers, with 0 ε T, a T-coloring of a graph G = (V, E) is a function f: V → IN0 such that for each {x,y} ε E, ¦f(x) − f(y)¦T. The T-span is the difference between the largest and smallest color and the T-span of G is the minimum span over all T-colorings of G. We show that the problem to find the T-span for a complete graph is NP-complete.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bonias, I.: T-colorings of complete graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1991)Google Scholar
  2. 2.
    Cozzens, M.B., Roberts, F.S.: T-colorings of graphs and the channel assignment problem. Congress Numerantium 35 (1982) 191–208Google Scholar
  3. 3.
    Cozzens, M.B., Roberts, F.S.: Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them. J. Comb. Inform. Syst. Sci., to appearGoogle Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)Google Scholar
  5. 5.
    Gräf, A.: Complete difference sets and T-colorings of complete graphs. Bericht, Universität Mainz 7 (1993)Google Scholar
  6. 6.
    Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497–1514Google Scholar
  7. 7.
    Liu, D.D.: Graph homomorphisms and the channel assignment problem. Ph.D. Thesis, University of South Carolina, Columbia, SC (1991)Google Scholar
  8. 8.
    Raychaudhuri, A.: Further results on T-colorings and frequency assignment problems. SIAM J. Disc. Math. to appearGoogle Scholar
  9. 9.
    Roberts, F.S.: From garbage to rainbows: Generalizations of graph colorings and their applications. Y. Alavi, G. Chartrand, O.R. Oellermann and A.J. Schwenk (eds.): Graph Theory, Combinatorics, and Applications, Vol. 2, Wiley, New York (1991) 1031–1052Google Scholar
  10. 10.
    Roberts, F.S.: T-colorings of graphs: recent results and open problems. Disc. Math. 93 (1991) 229–245Google Scholar
  11. 11.
    Tesman, B.: T-colorings, list T-colorings, and set T-colorings of graphs. Ph.D. Thesis, Rutgers University, New Brunswick, NJ (1989)Google Scholar
  12. 12.
    Wang, D.-I.: The channel assignment problem and closed neighborhood containment graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Klaus Jansen
    • 1
  1. 1.Fachbereich 11 - Mathematik, FG InformatikUniversität DuisburgDuisburgGermany

Personalised recommendations