๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Solution of the knight's Hamiltonian path problem on chessboards

โœ Scribed by Axel Conrad; Tanja Hindrichs; Hussein Morsy; Ingo Wegener

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
658 KB
Volume
50
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
โœ George R. T. Hendry ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 491 KB ๐Ÿ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap