Completely independent spanning trees in torus networks
From MaRDI portal
Publication:4648692
Recommendations
- Completely independent spanning trees in some regular graphs
- scientific article; zbMATH DE number 1953097
- On completely independent spanning trees in powers of graphs
- Completely independent spanning trees in k-th power of graphs
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
Cites work
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Balancing two spanning trees
- Completely independent spanning trees in the underlying graph of a line digraph
- Diameter-preserving orientations of the torus
- Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
- Edge-disjoint spanning trees for the generalized butterfly networks and their applications
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Finding Four Independent Trees
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Hamilton decompositions of Cartesian products of graphs
- scientific article; zbMATH DE number 1953097 (Why is no real title available?)
- scientific article; zbMATH DE number 913352 (Why is no real title available?)
- Independent spanning trees of chordal rings
- Independent Spanning Trees on Multidimensional Torus Networks
- Independent spanning trees with small depths in iterated line digraphs
- Independent trees in graphs
- Independent trees in planar graphs
- Multicast in wormhole-switched torus networks using edge-disjoint spanning trees.
- On edge-disjoint spanning trees in hypercubes
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- The multi-tree approach to reliability in distributed networks
- Three tree-paths
- Vertex disjoint routings of cycles over tori
Cited in
(37)- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
- Structural properties of subdivided-line graphs
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Degree conditions for completely independent spanning trees of bipartite graphs
- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- Reliability analysis based on the dual-CIST in shuffle-cubes
- A well-equalized 3-CIST partition of alternating group graphs
- Constructing dual-CISTs of DCell data center networks
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Completely independent spanning trees in (partial) \(k\)-trees
- Degree condition for completely independent spanning trees
- Two completely independent spanning trees of claw-free graphs
- Two completely independent spanning trees of P₄-free graphs
- Critical spanning tree and linear arrangement of torus
- Finding totally independent spanning trees with linear integer programming
- Constructing two completely independent spanning trees in hypercube-variant networks
- Ore's condition for completely independent spanning trees
- scientific article; zbMATH DE number 1953097 (Why is no real title available?)
- On completely independent spanning trees in powers of graphs
- Constructing completely independent spanning trees in crossed cubes
- Completely independent spanning trees in some regular graphs
- Independent spanning trees on even networks
- Constructing tri-CISTs in shuffle-cubes
- Constructing tri-CISTs in shuffle-cubes
- Two completely independent spanning trees of split graphs
- Completely independent spanning trees in line graphs
- Dirac's condition for completely independent spanning trees
- Independent spanning trees of product graphs
- Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- A sufficient condition for the existence of two completely independent spanning trees
- Fan-type condition for two completely independent spanning trees
- An innovative algorithm for generating three completely independent spanning trees in folded hypercube networks
- The completely independent spanning trees in P₄-free graphs
- Exponentiation of graphs
- Completely independent spanning trees in split graphs: structural properties and complexity
This page was built for publication: Completely independent spanning trees in torus networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648692)
