Obstructions to Injective Oriented Colourings

The question of deciding the existence of an oriented colouring which must also be locally injective on the in-neighbourhood of each vertex is polynomially solvable when the number of colours is at most three. In these cases, we describe efficient algorithms, based on colouring extension, which produce either the desired colouring or a forbidden substructure.