References
- G. H. Fricke, S. M. Hedetniemi, S. T. Hedetniemi, A. A. McRae, C. K. Wallis, M. S. Jacobson, W. W. Martin and W. D. Weakley, Combinatorial problems on chessboards: a brief survey, in Graph Theory, Combinatorics and Algorithms: Proceeding of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol. I. Y. Alavi and A. Schwenk, eds., Wiley, Hoboken NJ, 1995.
- H. Harborth and P. Stark, Independent knight's on triangular honeycombs, Congr. Numer. 126 (1997) 157–161.
- T. W. Haynes and M. A. Henning, Domination in graphs, in Handbook of Graph Theory, J. L. Gross and J. Yellen, eds., CRC Press, Boca Raton, 2004.
- S. M. Hedetniemi, S. T. Hedetniemi, and R. Reynolds, Combinatorial problems on chessboards: II, in Domination in Graphs: Advanced Topics, T. Haynes, S. T. Hedetniemi, and P. Slater, eds., Marcel Dekker, New York, 1998.
- J. D. E. Konhauser, D. Velleman, and S. Wagon, Which Way Did the Bicycle Go? Mathematical Association of America, Washington, DC, 1996.
- A. J. Schwenk, Which rectangular chessboards have a Knight's Tour? Math. Mag. 64 (1991) 325–332; available at http://dx.doi.org/10.2307/2690649.
- J. J. Watkins, Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, Princeton, NJ, 2004.
- J. J. Watkins, Knight's tours on triangular honeycombs, Congr. Numer. 124 (1997) 81–87.