论文信息 - Decomposing the hypercube Qn into n isomorphic edge-disjoint trees - 字舞流文

Decomposing the hypercube Qn into n isomorphic edge-disjoint trees

We show that the edge set of the n-dimensional hypercube Q"n is the disjoint union of the edge sets of n isomorphic trees.

Stephan G. Wagner | Marcel Wild | M. Wild | S. Wagner

[1] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2] Robert E. Tarjan,et al. A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees , 1985, Math. Oper. Res..

[3] Mark Ramras. Fundamental Subsets of Edges of Hypercubes , 1997, Ars Comb..

[4] Edgar M. Palmer,et al. On the spanning tree packing number of a graph: a survey , 2001, Discret. Math..

[5] Ron Rymon,et al. Search through Systematic Set Enumeration , 1992, KR.

[6] Marcel Wild,et al. Cover-preserving order embeddings into Boolean lattices , 1992 .

[7] E T. Leighton,et al. Introduction to parallel algorithms and architectures , 1991 .

[8] Ran Libeskind-Hadas,et al. On Edge-Disjoint Spanning Trees in Hypercubes , 1999, Inf. Process. Lett..

[9] Mark Ramras. Symmetric edge-decompositions of hypercubes , 1991, Graphs Comb..

[10] John Frederick Fink. On the decomposition of n-cubes into isomorphic trees , 1990, J. Graph Theory.