The following pages link to Independent trees in graphs (Q1323489):
Displaying 19 items.
- Independent spanning trees of chordal rings (Q294645) (← links)
- An efficient parallel construction of optimal independent spanning trees on hypercubes (Q362597) (← links)
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- Independent branchings in acyclic digraphs (Q1297456) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Four Edge-Independent Spanning Trees (Q3130452) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← links)
- (Q4703869) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees (Q5928871) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- Completely independent spanning trees in line graphs (Q6133659) (← links)
