Title of article
Bounds on the number of knightʹs tours Original Research Article
Author/Authors
Olaf Kyek، نويسنده , , Ian Parberry، نويسنده , , Ingo Wegener، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
11
From page
171
To page
181
Abstract
Knightʹs tours are a fascinating subject. New lower bounds on the number of knightʹs tours and structured knightʹs tours on n × n chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.
Keywords
Hamiltonian paths , Counting , Graph theory
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884514
Link To Document