A preserver problem with linearity hypothesis omitted can often be restated as a problem of finding all (weak) homomorphisms of certain, possible infinite graph. We will present some recent results where we essentially use graph theoretical tools to solve preserver problems. We will also present a problem of classifying Skew-Morphisms which originated from graph theory.