On the small cycle transversal of planar graphs (Q551170): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.02.040
@@ Property / DOI: 10.1016/j.tcs.2011.02.040 / rank @@
-Normal rank
@@ Property / cites work @@
+Polynomial-time data reduction for dominating set
@@ Property / cites work: Polynomial-time data reduction for dominating set / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cuts and judicious partitions in graphs without short cycles
+Normal rank
@@ Property / cites work @@
+Q4633868
@@ Property / cites work: Q4633868 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4517675
@@ Property / cites work: Q4517675 / rank @@
+Normal rank
@@ Property / cites work @@
+A Cubic Kernel for Feedback Vertex Set
@@ Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Planar Feedback Vertex Set
@@ Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth 9 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+On Generating Triangle-Free Graphs
@@ Property / cites work: On Generating Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549693
@@ Property / cites work: Q3549693 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5704408
@@ Property / cites work: Q5704408 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+The size of bipartite graphs with a given girth
@@ Property / cites work: The size of bipartite graphs with a given girth / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Subgraphs without Short Cycles
+Normal rank
@@ Property / cites work @@
+Finding next-to-shortest paths in a graph
@@ Property / cites work: Finding next-to-shortest paths in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Q4633817
@@ Property / cites work: Q4633817 / rank @@
+Normal rank
@@ Property / cites work @@
+Star coloring high girth planar graphs
@@ Property / cites work: Star coloring high girth planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization for Cycle Transversal Problems
@@ Property / cites work: Kernelization for Cycle Transversal Problems / 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
@@ Property / cites work @@
+Equitable list colorings of planar graphs without short cycles
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.02.040
@@ Property / DOI: 10.1016/J.TCS.2011.02.040 / rank @@
+Normal rank