Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074): Difference between revisions

@@ Property / cites work @@
+Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
+Normal rank
@@ Property / cites work @@
+Finding Four Independent Trees
@@ Property / cites work: Finding Four Independent Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Arrangement graphs: A class of generalized star graphs
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees on the star network with applications to fault tolerance
+Normal rank
@@ Property / cites work @@
+Independent trees in planar graphs
@@ Property / cites work: Independent trees in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Independent spanning trees of chordal rings
@@ Property / cites work: Independent spanning trees of chordal rings / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum broadcasting and personalized communication in hypercubes
+Normal rank
@@ Property / cites work @@
+Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
+Normal rank
@@ Property / cites work @@
+The locally twisted cubes
@@ Property / cites work: The locally twisted cubes / rank @@
+Normal rank