The Electronic Journal of Combinatorics

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].

  1. E. J. Cockayne, Chessboard domination problems, Discrete Math. 86 (1990), 13--20.
  2. V. Raghavan and S. M. Venkatesan, On bounds for a covering problem, Inform. Process. Lett. 25 (1987), 281--284.