Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313): Difference between revisions

@@ Property / cites work @@
+Covering planar graphs with forests
@@ Property / cites work: Covering planar graphs with forests / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional arboricity, strength, and principal partitions in graphs and matroids
+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 @@
+Decomposing a graph into pseudoforests with one having bounded degree
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+Covering planar graphs with forests, one having bounded maximum degree
+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 @@
+Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
+Normal rank
@@ Property / cites work @@
+A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
+Normal rank
@@ Property / cites work @@
+The game coloring number of planar graphs
@@ Property / cites work: The game coloring number of planar graphs / rank @@
+Normal rank