Pages that link to "Item:Q1288514"
From MaRDI portal
The following pages link to Independent trees in planar graphs (Q1288514):
Displaying 26 items.
- An efficient parallel construction of optimal independent spanning trees on hypercubes (Q362597) (← links)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- The generalized 4-connectivity of hypercubes (Q507578) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← links)
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← 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)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← 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)
- \((t, s)\)-completely independent spanning trees (Q6575408) (← links)
