scientific article; zbMATH DE number 1953097
From MaRDI portal
Publication:4414501
Recommendations
Cited in
(47)- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- Completely independent spanning trees in line graphs
- scientific article; zbMATH DE number 1444313 (Why is no real title available?)
- Sufficient conditions for protection routing in IP networks
- Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks
- Completely independent spanning trees in some regular graphs
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
- Completely independent spanning trees in the underlying graph of a line digraph
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- Completely independent spanning trees in k-th power of graphs
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
- \((t, s)\)-completely independent spanning trees
- Finding totally independent spanning trees with linear integer programming
- On completely independent spanning trees in powers of graphs
- scientific article; zbMATH DE number 1696542 (Why is no real title available?)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph
- Comments on: ``A Hamilton sufficient condition for completely independent spanning tree
- Completely independent spanning trees in torus networks
- Degree conditions for completely independent spanning trees of bipartite graphs
- A Hamilton sufficient condition for completely independent spanning tree
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- Constructing dual-CISTs of DCell data center networks
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing
- Constructing two completely independent spanning trees in hypercube-variant networks
- Constructing dual-CISTs of folded divide-and-swap cubes
- Ore's condition for completely independent spanning trees
- Two counterexamples on completely independent spanning trees
- A well-equalized 3-CIST partition of alternating group graphs
- A two-stages tree-searching algorithm for finding three completely independent spanning trees
- Completely independent spanning trees in (partial) \(k\)-trees
- Constructing completely independent spanning trees in crossed cubes
- Degree condition for completely independent spanning trees
- Constructing tri-CISTs in shuffle-cubes
- Constructing tri-CISTs in shuffle-cubes
- Two completely independent spanning trees of \(P_4\)-free graphs
- Independent spanning trees with small depths in iterated line digraphs
- An efficient parallel construction of optimal independent spanning trees on hypercubes
- Spanning trees with nonseparating paths
- Plane Triangulations Without Spanning 2-Trees
- Structural properties of subdivided-line graphs
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
- The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs
- Reliability analysis based on the dual-CIST in shuffle-cubes
- The absence of efficient dual pairs of spanning trees in planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414501)
