Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

Wagner, Stephan ; Wild, Marcel (TU Graz University of Technology, 2011)

The original publication is available at http://www.math.tugraz.at/~wagner/Hypercube.pdf

Article

ENGLISH ABSTRACT: The problem of finding edge-disjoint trees in a hypercube e.g. arises in the context of parallel computing. Independent of applications it is of high aesthetic appeal.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/16108
This item appears in the following collections: