 Additionally, a Hamiltonian path exists between two vertices and if and only if they have different colors in a -coloring of the graph.Both facts are easy to prove using the principle of induction on the dimension of the hypercube, and the construction of the hypercube graph by joining two smaller hypercubes with a matching.Hamiltonicity of the hypercube is tightly related to the theory of Gray codes.