Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2074859967
@@ Property / OpenAlex ID: W2074859967 / rank @@
+Normal rank
@@ Property / cites work @@
+Lee distance and topological properties of k-ary n-cubes
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Many-to-many disjoint paths in faulty hypercubes
@@ Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
+Normal rank
@@ Property / cites work @@
+The two-equal-disjoint path cover problem of matching composition network
+Normal rank
@@ Property / cites work @@
+Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
+Normal rank
@@ Property / cites work @@
+Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
+Normal rank
@@ Property / cites work @@
+One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
+Normal rank
@@ Property / cites work @@
+Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
+Normal rank