Locally Constrained Graph Homomorphisms - Structure, Complexity, and Applications

Abstract

In the survey paper are explloited locally constrained (bijective, injective and surjective) homomorphisms. Their structural relationship is explored, as well as computational complexity ad their applications in other fields of mathematics and computer science.

Keywords

• Locally
• Constrained
• Graph
• Homomorphisms
• Structure
• Complexity
• Applications