Knight's tours on rectangular chessboards using external squares

DOI10.1155/2014/210892zbMath1309.05083OpenAlexW1978508714WikidataQ59048955 ScholiaQ59048955MaRDI QIDQ2018959

Steven J. Winters, Linda Eroh, Grady D. Bullington, Garry L. Johns

Publication date: 26 March 2015

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/210892

zbMATH Keywords

Hamiltonian cyclestournamentsbigraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Combinatorics (educational aspects) (97K20)

Related Items (1)

Tours of a generalized knight on rectangular chessboards

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized knight's tour on 3D chessboards
• Which chessboards have a closed knight's tour within the rectangular prism?
• The closed knight tour problem in higher dimensions
• Generalized knight's tours on rectangular chessboards
• Closed Knight's Tours with Minimal Square Removal for All Rectangular Boards
• Which Rectangular Chessboards Have a Knight's Tour?

This page was built for publication: Knight's tours on rectangular chessboards using external squares