Paired many-to-many disjoint path covers in faulty hypercubes (Q391966): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C45
@@ Property / Mathematics Subject Classification ID: 05C45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M15
@@ Property / Mathematics Subject Classification ID: 68M15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6244600
@@ Property / zbMATH DE Number: 6244600 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+disjoint path cover
@@ Property / zbMATH Keywords: disjoint path cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hypercube
@@ Property / zbMATH Keywords: hypercube / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+fault tolerance
@@ Property / zbMATH Keywords: fault tolerance / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+strongly Hamiltonian laceability
@@ Property / zbMATH Keywords: strongly Hamiltonian laceability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph theory
@@ Property / zbMATH Keywords: graph theory / rank @@
+Normal rank

Revision as of 15:20, 29 June 2023