Independent spanning trees in crossed cubes (Q5920317): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2013.06.004
@@ Property / DOI: 10.1016/j.ipl.2013.06.004 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2013.06.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2022070194
@@ Property / OpenAlex ID: W2022070194 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete path embeddings in crossed cubes
@@ Property / cites work: Complete path embeddings in crossed cubes / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
+Normal rank
@@ Property / cites work @@
+Constructing edge-disjoint spanning trees in locally twisted cubes
+Normal rank
@@ Property / cites work @@
+Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
+Normal rank
@@ Property / cites work @@
+Constructing the nearly shortest path in crossed cubes
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
+Normal rank
@@ Property / cites work @@
+Independent Spanning Trees on Multidimensional Torus Networks
+Normal rank
@@ Property / cites work @@
+Constructing edge-disjoint spanning trees in twisted cubes
+Normal rank
@@ Property / cites work @@
+On the double-vertex-cycle-connectivity of crossed cubes
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2013.06.004
@@ Property / DOI: 10.1016/J.IPL.2013.06.004 / rank @@
+Normal rank