A332044
a(n) is the length of the shortest circuit that visits every edge of an undirected n X n grid graph.
offset: 2
codomain: ℕ
Declarations
Section titled “Declarations”- A332044computable
a(n) is the length of the shortest circuit that visits every edge of an undirected n X n grid graph.