NC algorithms for partitioning sparse graphs into induced forests with an application (Q6487991): Difference between revisions

@@ Property / cites work @@
+An approach to the subgraph homeomorphism problem
@@ Property / cites work: An approach to the subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+The point-arboricity of a graph
@@ Property / cites work: The point-arboricity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Point-Arboricity of Planar Graphs
@@ Property / cites work: The Point-Arboricity of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphism theorems for graphs
@@ Property / cites work: Homomorphism theorems for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763420
@@ Property / cites work: Q4763420 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank