v8i1r29 — Comment by the authors, Aug 25, 2003.

In the above paper, the theorem that at least (n-1)/2 queens are
required to dominate the n by n chessboard was
attributed to P. H. Spencer, in [1].
A proof of this result appeared in the earlier work [2].