Locally constrained graph homomorphisms—structure, complexity, and applications

Jiří Fiala, Jan Kratochvíl
2008 Computer Science Review  
A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained homomorphisms are those that behave well on the neighborhoods of vertices -if the neighborhood of any vertex of the source graph is mapped bijectively (injectively, surjectively) to the neighborhood of its image in the target graph, the homomorphism is called locally bijective (injective, surjective, respectively). We show that this view unifies issues studied before from different perspectives and
more » ... under different names, such as graph covers, distance constrained graph labelings, or role assignments. Our survey provides an overview of applications, complexity results, related problems, and historical notes on locally constrained graph homomorphisms.
doi:10.1016/j.cosrev.2008.06.001 fatcat:p57dezmpfjhzpf5xahy4f7rtga