Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth

Abstract

We study computational complexity of locally constrained homomorphisms when both graphs are a part of the input

Keywords

• computational complexity
• homomorphisms