Every Fibonacci cube has a Hamiltonian path... a path in an…

Every Fibonacci cube has a Hamiltonian path... a path in an undirected or directed graph that visits each vertex exactly once. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete. (Wiki)

https://twetch.app/t/154f770cc3f91b8d8d7c316b8416c922cc013a747e463109b7549e0d07dab134