Graph that can be decomposed into edge disjoint hamilton cycles is said to be hamiltonian decomposable. Hamiltonian decomposition is applicable to many network and parallel algorithm problems.
Hamiltonian decomposability of hypercubes is already proved by Alspach, et al. But this result is not lead to simple construction of hamiltonian decomposition of hypercube.
We present a simple algorithm to get a hamiltonian decomposition of higher dimension hypercube from that of lower dimension hypercube, and analysis this algorithm with decomposition of 6 dimension hypercube. At the last, we consider the algorithm for general hypercubes and present promising result from tests of hypercubes of less dimension than 20.
