Decomposing graphs into paths and trees (Q1690003): Difference between revisions

@@ Property / cites work @@
+Edge-decomposition of graphs into copies of a tree with four edges
+Normal rank
@@ Property / cites work @@
+Claw‐decompositions and tutte‐orientations
@@ Property / cites work: Claw‐decompositions and tutte‐orientations / rank @@
+Normal rank
@@ Property / cites work @@
+Decompositions of highly connected graphs into paths of length five
+Normal rank
@@ Property / cites work @@
+Decomposing highly edge-connected graphs into paths of any given length
+Normal rank
@@ Property / cites work @@
+Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
+Normal rank
@@ Property / cites work @@
+Decompositions of highly connected graphs into paths of length 3
+Normal rank
@@ Property / cites work @@
+Edge-decompositions of highly connected graphs into paths
+Normal rank
@@ Property / cites work @@
+The weak 3-flow conjecture and the weak circular flow conjecture
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into bistars
@@ Property / cites work: Decomposing a graph into bistars / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing graphs into paths of fixed length
@@ Property / cites work: Decomposing graphs into paths of fixed length / rank @@
+Normal rank