Article ID Journal Published Year Pages File Type
9513239 Discrete Mathematics 2005 13 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The recognition of bound quivers using edge-coloured homomorphisms
Authors
, , , ,