The process of finding Hamilton paths in the n-dimensional Mbius cube was studied,and the relative algorithm of the cycle-embedding of length l (4≤ l ≤2\+ n )into the n-dimensional Mbius cube was also given.The time complexity of this algorithm is O( l ).It is much lower than the time complexity O(NlogN),N=2\+ n ,which Fan Jianxi has given to us.
