The recognition of bound quivers using edge-coloured homomorphisms

These results are developed using homomorphisms of edge-coloured graphs. Our work includes a classification of the computational complexity of edge-coloured homomorphism problems where the target is of order at most three.