
\begin{thebibliography}{99}

\bibitem{amp} R. Aharoni, E. C. Milner and K. Prikry, Unfriendly
partitions of graphs, {\em J. Combin. Theory Ser. B}, {\bf 50} (1990),
1--10.

\bibitem{bhh} J.-P. Bode, H. Harborth, and M. Harborth, King
independence on triangle boards, {Discrete Math.}, {\bf 266} (2003),
101--107.

\bibitem{dhlm} J. E. Dunbar, D. G. Hoffman, R. C. Laskar, L. R. Markus,
$\alpha$-domination, {\em Discrete Math.}, {\bf  211} (2000), 11--26.

\bibitem{dlb} R. D. Dutton, R. Lee, and R. C. Brigham, Bounds on a graph's
security number, {\em Discrete Appl. Math.}, {\bf 156} (2008),
695--704.

\bibitem{fj} J. Fink and M.S. Jacobson, n-domination in graphs, in Y. Alavi, G.
Chartrand, L. Lesniak, D. Lick, C. Wall, eds., {\em Graph Theory
with Applications to Algorithms and Computer Science},
Wiley-Interscience, New York, (1985), pp.\ 283--300.

\bibitem{hedetniemi} S. M. Hedetniemi, S. T. Hedetniemi and R. Reynolds,
Combinatorial problems on chessboards: II, in T. W. Haynes, S. T.
Hedetniemi, and P. J. Slater, eds., {\em Domination in Graphs:  Advanced
Topics}, Marcel Dekker, New York (1998), pp.\ 133--162.

\bibitem{ipw} E. J. Ionascu, D. Pritikin, S. E. Wright,  $k$-dependence
and domination in kings graphs, {\em Amer. Math. Monthly}, {\bf 115}
(2008), 820--836.

\bibitem{sr} J. M. Sigarreta and J. A. Rodr\'{\i}guez,  On
global offensive alliance number of a graph, {\em Discrete Appl.
Math.}, (2008), doi:10.10.1016/j.dam2008.02.007

\bibitem{wrm} J. Watkins, C. Ricci, B. McVeigh, King's domination and
independence: a tale of two chessboards, {\em Congr. Numer.}, {\bf
158} (2002), 59--66.

\bibitem{w} J. Watkins, {\em Across the Board: The Mathematics of
Chess Board Problems}, Princeton University Press, 2004.

