Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth

Abstrakt

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

Klíčová slova

• computational complexity
• homomorphisms