Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees (Q418894): Difference between revisions

@@ Property / cites work @@
+On edge-disjoint spanning trees in hypercubes
@@ Property / cites work: On edge-disjoint spanning trees in hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+On the decomposition of <i>n</i>‐cubes into isomorphic trees
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+On the spanning tree packing number of a graph: A survey
+Normal rank
@@ Property / cites work @@
+Q4940037
@@ Property / cites work: Q4940037 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric edge-decompositions of hypercubes
@@ Property / cites work: Symmetric edge-decompositions of hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Cover-preserving order embeddings into Boolean lattices
+Normal rank