Skip to main content
SpringerLink
Log in

A rainbow about T-colorings for complete graphs

  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 790))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonias, I.: T-colorings of complete graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1991)

    Google Scholar 

  2. Cozzens, M.B., Roberts, F.S.: T-colorings of graphs and the channel assignment problem. Congress Numerantium 35 (1982) 191–208

    Google Scholar 

  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 appear

    Google Scholar 

  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. Gräf, A.: Complete difference sets and T-colorings of complete graphs. Bericht, Universität Mainz 7 (1993)

    Google Scholar 

  6. Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68 (1980) 1497–1514

    Google Scholar 

  7. Liu, D.D.: Graph homomorphisms and the channel assignment problem. Ph.D. Thesis, University of South Carolina, Columbia, SC (1991)

    Google Scholar 

  8. Raychaudhuri, A.: Further results on T-colorings and frequency assignment problems. SIAM J. Disc. Math. to appear

    Google Scholar 

  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–1052

    Google Scholar 

  10. Roberts, F.S.: T-colorings of graphs: recent results and open problems. Disc. Math. 93 (1991) 229–245

    Google Scholar 

  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. Wang, D.-I.: The channel assignment problem and closed neighborhood containment graphs. Ph.D. Thesis, Northeastern University, Boston, MA (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 11 - Mathematik, FG Informatik, Universität Duisburg, Postfach 11 05 03, D-47048, Duisburg, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jansen, K. (1994). A rainbow about T-colorings for complete graphs. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation