Chang, Gerard J. (1998), «Algorithmic aspects of domination in graphs», in: Du, Ding-Zhu; Pardalos, Panos M., Handbook of combinatorial optimization, Vol. 3, Boston, MA: Kluwer Acad. Publ., pp. 339–405, MR1665419. Chang defines the king's graph on p. 341.
Berend, Daniel; Korach, Ephraim; Zucker, Shira (2005), «Two-anticoloring of planar and related graphs»(PDF), 2005 International Conference on Analysis of Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR2193130.
emis.ams.org
Berend, Daniel; Korach, Ephraim; Zucker, Shira (2005), «Two-anticoloring of planar and related graphs»(PDF), 2005 International Conference on Analysis of Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR2193130.
books.google.com
Chang, Gerard J. (1998), «Algorithmic aspects of domination in graphs», in: Du, Ding-Zhu; Pardalos, Panos M., Handbook of combinatorial optimization, Vol. 3, Boston, MA: Kluwer Acad. Publ., pp. 339–405, MR1665419. Chang defines the king's graph on p. 341.
doi.org
dx.doi.org
Smith, Alvy Ray (1971), «Two-dimensional formal languages and pattern recognition by cellular automata», 12th Annual Symposium on Switching and Automata Theory, pp. 144–152, doi:10.1109/SWAT.1971.29.