Structure and complexity of locally constrained graph homomorphisms

Abstract

The thesis discuss locally constrained graph homomorphisms, from the view of structural constraints as well as on the computational complexity of the associated decision problems.

Keywords

• Structure
• complexity
• locally
• constrained
• graph
• homomorphisms