Abstract
A closed knight's tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. In 1991 Schwenk completely classified the $m\times n$ rectangular chessboards that admit a closed knight's tour. In honor of the upcoming twentieth anniversary of the publication of Schwenk's paper, this article extends his result by classifying the $i\times j\times k$ rectangular prisms that admit a closed knight's tour.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献