Text this: On approximate graph colouring and max-k-cut algorithms based on the θ-function