Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

Wagner, Stephan ; Wild, Marcel (2011)

The original publication is available at


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:
This item appears in the following collections: