Text this: NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem