Pages that link to "Item:Q1606920"
From MaRDI portal
The following pages link to On edge-disjoint spanning trees in hypercubes (Q1606920):
Displaying 9 items.
- Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees (Q418894) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- Completely independent spanning trees in some regular graphs (Q516807) (← links)
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes (Q638549) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (Q2039695) (← links)
- Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← links)
- Packing the hypercube (Q5405279) (← links)