An historical tour of binary and tours

MaRDI QIDQ3295613zbMATH OpenFDO

Authors David Singmaster

Publication date 10 July 2020

zbMATH Keywords

binary representationspaths on graphsrecreational mathematics

Mathematics Subject Classification ID

Recreational mathematics (00A08) General histories, source books (01A05) History of game theory, economics, and finance (91-03) Combinatorial games (91A46)

Recommendations

• Representation of Graphs in Diagrams of Graph Theory
• Hamiltonian Checkerboards
• On the possibility of an Euler tour representation by Gray codes
• The number of knight's tours equals 33, 439, 123, 484, 294---counting with binary decision diagrams
• A method for finding Hamilton paths and Knight's tours

Cited in

(1)

• Euler's enumerations

This page was built for publication: An historical tour of binary and tours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295613)