N. Beluhov

activity

20132026

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Slitherlink Signatures

Nikolai Beluhov

Let $G$ be a planar graph and let $C$ be a cycle in $G$ . Inside of each finite face of $G$ , we write down the number of edges of that face which belong to $C$ . This is the signatur…

math.CO2023

Snake Paths in King and Knight Graphs

Nikolai Beluhov

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 \times n$ king graph and w…