We consider words w over the alphabet Σ={ 0, 1, 2 }. It is shown that there are irreducibly square-free words of all lengths n except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions uu as factors), but by removing any one internal letter creates a square in the word.