Abstract. We prove that there is a Steiner triple system T such that every simple cubic graph can have its edges coloured by points of T in such a way that for each vertex the colours of the three incident edges form a triple in T. The Steiner triple system employed in our proof has order 381 and now, after several years, we know that it is not the smallest possible.