Three tree-paths
From MaRDI portal
Recommendations
- Paths, Stars and the Number Three
- Walks and paths in trees
- The three-in-a-tree problem
- scientific article; zbMATH DE number 7370928
- Packing three trees
- Trees with depression three
- scientific article; zbMATH DE number 7700587
- Trees with 2-reinforcement number three
- On constructing 2-3 trees
- Decomposition of triply rooted trees
Cites work
Cited in
(47)- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- On independent spanning trees
- Independent trees in planar graphs
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
- Reliable broadcasting in product networks
- A multi-tree routing scheme using acyclic orientations
- Power assignment for k-connectivity in wireless ad hoc networks
- A problem of tree graph
- An algorithm to construct independent spanning trees on parity cubes
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Structural properties of subdivided-line graphs
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
- Construction independent spanning trees on locally twisted cubes in parallel
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Spanning 3-connected index of graphs
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- On spanning disjoint paths in line graphs
- Mondshein sequences (a.k.a. (2,1)-orders)
- Independent spanning trees of chordal rings
- Independent spanning trees on folded hyper-stars
- Four edge-independent spanning trees
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- A comment on ``Independent spanning trees in crossed cubes
- Completely independent spanning trees in torus networks
- scientific article; zbMATH DE number 1372667 (Why is no real title available?)
- Paths, Stars and the Number Three
- Construction of optimal independent spanning trees on folded hypercubes
- Constructing node-independent spanning trees in augmented cubes
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)
- A linear-time algorithm to find four independent spanning trees in four connected planar graphs
- Constructing independent spanning trees for locally twisted cubes
- Independent spanning trees on even networks
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Independent spanning trees with small depths in iterated line digraphs
- Independent spanning trees in crossed cubes
- Independent spanning trees of product graphs
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- \((t, s)\)-completely independent spanning trees
- Spanning trees: A survey
- Independent spanning trees on twisted cubes
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
This page was built for publication: Three tree-paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3475297)
