Independent trees in graphs
From MaRDI portal
Publication:1323489
DOI10.1007/BF01202468zbMath0796.05026OpenAlexW2035780934MaRDI QIDQ1323489
Publication date: 15 September 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202468
Related Items (19)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Independent spanning trees of chordal rings ⋮ Unnamed Item ⋮ An efficient parallel construction of optimal independent spanning trees on hypercubes ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Completely independent spanning trees in line graphs ⋮ Spanning trees: A survey ⋮ Independent spanning trees on twisted cubes ⋮ Completely independent spanning trees in torus networks ⋮ Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Independent spanning trees on even networks ⋮ Independent spanning trees with small depths in iterated line digraphs ⋮ Disjoint paths in arborescences ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent branchings in acyclic digraphs ⋮ Four Edge-Independent Spanning Trees ⋮ Independent spanning trees in crossed cubes
Cites Work
- Paths in graphs, reducing the edge-connectivity only by two
- The multi-tree approach to reliability in distributed networks
- On independent spanning trees
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Dividing a Graph into Triconnected Components
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Independent trees in graphs
