There are six distinct ways in which the vertices of a 4-cycle may be coloured with two colours, called \text{colouring types}. Let be the set of these colouring types and let be a non-empty subset of . Suppose we colour the vertices of with two colours. If is a 4-cycle decomposition of such that the colouring type of each 4-cycle is in , then is said to have a \emph{colouring of type} . Furthermore, the colouring is said to be \emph{proper} if every colouring type in is represented in . For all possible of size one, two or three, excluding three cases already settled, we completely settle the existence question for 4-cycle decompositions of with a colouring of type .