In this talk we will survey notions of generalized graph colorings as
various kinds of graph homomorphisms and as so called distance constrained
labelings. We present some complexity results and some algorithmic
approaches for general graphs as well as for restricted graph classes, e.g.
trees or disk graphs. Finally, we would like to present the motivation
stemming from the telecommunication industry and discuss open problems.