Edge-colored graphs with applications to homogeneous faults (Q1944099): Difference between revisions

@@ Property / arXiv ID @@
+.5439
@@ Property / arXiv ID: 1207.5439 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorful isomorphic spanning trees in complete graphs
+Normal rank
@@ Property / cites work @@
+Q4737267
@@ Property / cites work: Q4737267 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Generalized cover-free families.
@@ Property / cites work: Generalized cover-free families. / rank @@
+Normal rank
@@ Property / cites work @@
+Secure communication in multicast channels: The answer to Franklin and Wright's question
+Normal rank