+This section ends with the idea of removing a Hamiltonian cycle in the
+$\mathsf{N}$-cube.
+In such a context, the Hamiltonian cycle is equivalent to a Gray code.
+Many approaches have been proposed a way to build such codes, for instance
+the Reflected Binary Code. In this one, one of the bits is switched
+exactly $2^{\mathsf{N}-}$ for a $\mathsf{N}$-length cycle.
+
+%%%%%%%%%%%%%%%%%%%%%
+
+The function that is built
+from the
+
+The next section presents how to build balanced Hamiltonian cycles in the