Snake Paths in King and Knight Graphs
Nikolai Beluhov

TL;DR
This paper investigates the maximum length of snake paths in king and knight graphs, providing exact results for king graphs and estimates for knight graphs, highlighting differences between even and odd cases.
Contribution
It determines the maximum snake path length in n x n king graphs and characterizes the paths, also estimating maximum lengths in m x n knight graphs for all dimensions.
Findings
Maximum snake path length in n x n king graphs is found and characterized.
Different behaviors are observed between even and odd cases.
Estimated maximum lengths for snake paths or cycles in m x n knight graphs.
Abstract
A snake path in a graph is a path in which is also an induced subgraph of . For all , we find the greatest length of a snake path in the 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 knight graph, for all and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Interconnection Networks and Systems
