On the decomposition of n‐cubes into isomorphic trees
John Frederick Fink · Journal of Graph Theory · 1990
Abstract We prove that if T is any tree having n edges (n ≥ 1), then the n‐cube Qn can be decomposed into 2n‐1 edge‐disjoint induced subgraphs, each of which is isomorphic to T. We use this statement to obtain two results concerning decompositions of Qn into subgraphs isomorphic to members of a specified family of trees.