An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695): Difference between revisions

@@ Property / cites work @@
+The Proper Interval Colored Graph problem for caterpillar trees
+Normal rank
@@ Property / cites work @@
+Q4281679
@@ Property / cites work: Q4281679 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+On Feedback Vertex Set New Measure and New Structures
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph bandwidth of weighted caterpillars
@@ Property / cites work: Graph bandwidth of weighted caterpillars / rank @@
+Normal rank
@@ Property / cites work @@
+Q3395507
@@ Property / cites work: Q3395507 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs and matching theorems
@@ Property / cites work: Graphs and matching theorems / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the bandwidth minimization problem
+Normal rank
@@ Property / cites work @@
+A Quartic Kernel for Pathwidth-One Vertex Deletion
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank