Snake paths in king and knight graphs
Nikolai Beluhov · Enumerative Combinatorics and Applications · 2023
A snake path in a graph G is a path in G which is also an induced subgraph of G.For all n, we find the greatest length of a snake path in the n × n king graph and we give a complete description of the paths which attain this greatest length.The even and odd cases behave very differently.We also estimate the greatest length of a snake path or cycle in the m × n knight graph, for all m and n.