Mathematics — Graph Theory · hamiltonian-paths-hypercube
Problem
Let n≥1. Let Qn be the n-hypercube graph, as in Definition 2.14.7. Recall that ``hamp'' is short for ``Hamiltonian path''.
At what vertices can a hamp of Qn end if it starts at the vertex 00⋯0? (Find all possibilities, and prove that they are possible and all other vertices are impossible.)