On edge-disjoint spanning trees in hypercubes
From MaRDI portal
Publication:1606920
DOI10.1016/S0020-0190(99)00033-2zbMath1002.68103WikidataQ127125068 ScholiaQ127125068MaRDI QIDQ1606920
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (9)
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Packing the hypercube ⋮ Completely independent spanning trees in torus networks ⋮ Edge-independent spanning trees in augmented cubes ⋮ Completely independent spanning trees in some regular graphs ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
This page was built for publication: On edge-disjoint spanning trees in hypercubes
