Thin trees in 8-edge-connected planar graphs (Q1711432): Difference between revisions

@@ Property / cites work @@
+Q5365094
@@ Property / cites work: Q5365094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded diameter arboricity
@@ Property / cites work: Bounded diameter arboricity / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests
@@ Property / cites work: Decomposing a graph into forests / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth at least 8 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth 9 into a forest and a matching
+Normal rank