Abstrakt
The thesis explores structural properties necessary for the existence of a locally injective and locally bijective graph homomorphisms. Computational aspects of this problem are apllied to freqency assignment problem in telecommunication networks.