[
[CFPT81] E. J. Cockayne, O. Favaron, C. Payan, and A. Thomason. Contributions to the theory of domination, independence and irredundance in graphs. Discrete Mathematics, 33(3): 249–258, 1981.
]Search in Google Scholar
[
[CH86] E.J. Cockayne and S.T. Hedetniemi, A note on the diagonal queens domination problem, J. Combin. Theory Ser. A 42, 137–139, 1986.
]Search in Google Scholar
[
[FHHMWJMW95] G. Fricke, S. M. Hedetniemi, S. T. Hedetniemi, A. McRae, CK˙ . Wallis, M. S. Jacobson, H. W. Martin, and W. D. Weakley, Combinatorial problems on chessboards: a brief survey. In Graph Theory, Combinatorics, and Algorithms: Proc. 7th Quadrennial Internat. Conf. on the Theory and Applications of Graphs (Y. Alavi and A. Schwenk, eds.), volume 1, 507–528, 1995.
]Search in Google Scholar
[
[HHS98] T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Domination in graphs: advanced topics, volume 209 of monographs and textbooks in pure and applied mathematics, 1998.
]Search in Google Scholar
[
[Oeis] The On-Line Encyclopedia of Integer Sequences, published electronically at https://oeis.org, accessed in 2022.
]Search in Google Scholar
[
[Wat12] J. J. Watkins. Across the Board: The Mathematics of Chessboard Problems. Princeton University Press, 2012.
]Search in Google Scholar
