Chessboard Domination Problems

https://doi.org/10.1016/S0167-5060(08)71033-1Get rights and content

A graph may be formed from n × n chessboard by taking the squares as the vertices and two vertices are adjacent if a chess piece situated on one square covers the other. In this paper we survey some recent results concerning domination parameters for certain graphs constructed in this way.

References (15)

  • F.A. Behrend

    On sets of integers which contain no 3 terms in arithmetic progression.

    Proc. Nat. Acad. Sci. U. S. A.

    (1946)
  • C. Berge
  • E.J. Cockayne. B. Gamble and B. Shepherd, Domination of chessboards by queens on a column, Ars. Combin., to...
  • E.J. Cockayne, B. Gamble, B. Shepherd. Domination parameters for the bishops graph. Discrete Math., to...
  • E.J. Cockayne et al.

    A note on the diagonal queens domination problem, J.

    Combin. Theory Ser. A

    (1986)
  • E.J. Cockayne, P.H. Spencer. An upper bound for the independent domination number of the queens graph,...
  • C.F. De Jaenisch
There are more references available in the full text version of this article.

Cited by (0)

View full text