An enhancement of Nash-Williams' theorem on edge arboricity of graphs (Q1750785): Difference between revisions

@@ Property / cites work @@
+Decompositions of graphs into trees, forests, and regular subgraphs
+Normal rank
@@ Property / cites work @@
+A short proof of Nash-Williams' theorem for the arboricity of a graph
+Normal rank
@@ Property / cites work @@
+Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
+Normal rank
@@ Property / cites work @@
+On the chromatic index and the cover index of a multigraph
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests: the nine dragon tree conjecture is true
+Normal rank
@@ Property / cites work @@
+Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests
@@ Property / cites work: Decomposing a graph into forests / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank