Bounds on the number of knight's tours
From MaRDI portal
Publication:1356517
DOI10.1016/S0166-218X(96)00031-5zbMath0883.05093MaRDI QIDQ1356517
Olaf Kyek, Ingo Wegener, Ian Parberry
Publication date: 1 March 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Generalized knight's tour on 3D chessboards ⋮ Taming the knight's tour: minimizing turns and crossings ⋮ Generalized knight's tours on rectangular chessboards
Cites Work
This page was built for publication: Bounds on the number of knight's tours
