One-to-one disjoint path covers on multi-dimensional tori (Q5248088): Difference between revisions

@@ Property / cites work @@
+The super laceability of the hypercubes
@@ Property / cites work: The super laceability of the hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in hypercubes with prescribed origins and lengths
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
+Normal rank
@@ Property / cites work @@
+Extraconnectivity of \(k\)-ary \(n\)-cube networks
+Normal rank
@@ Property / cites work @@
+THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
+Normal rank
@@ Property / cites work @@
+General-demand disjoint path covers in a graph with faulty elements
+Normal rank
@@ Property / cites work @@
+Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
+Normal rank
@@ Property / cites work @@
+THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
+Normal rank
@@ Property / cites work @@
+Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanners in tori
@@ Property / cites work: Edge-disjoint spanners in tori / rank @@
+Normal rank
@@ Property / cites work @@
+The super connectivity of the pancake graphs and the super laceability of the star graphs
+Normal rank
@@ Property / cites work @@
+On the spanning connectivity and spanning laceability of hypercube-like networks
+Normal rank
@@ Property / cites work @@
+One-to-many node-disjoint paths of hyper-star networks
+Normal rank
@@ Property / cites work @@
+The spanning connectivity of folded hypercubes
@@ Property / cites work: The spanning connectivity of folded hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Single-source three-disjoint path covers in cubes of connected graphs
+Normal rank
@@ Property / cites work @@
+One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
+Normal rank
@@ Property / cites work @@
+The super-connected property of recursive circulant graphs
+Normal rank