Kernelization for cycle transversal problems (Q423937): Difference between revisions

@@ Property / author @@
-Yong Zhang
@@ Property / author: Yong Zhang / rank @@
-Normal rank
@@ Property / author @@
+Yong Zhang
@@ Property / author: Yong Zhang / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6039489
@@ Property / zbMATH DE Number: 6039489 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cycle transversal
@@ Property / zbMATH Keywords: cycle transversal / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2011.12.024
+Normal rank
@@ Property / OpenAlex ID @@
+W1977629138
@@ Property / OpenAlex ID: W1977629138 / rank @@
+Normal rank
@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite subgraphs
@@ Property / cites work: Bipartite subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+<i>M</i>-degrees of quadrangle-free planar graphs
@@ Property / cites work: <i>M</i>-degrees of quadrangle-free planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Generating Triangle-Free Graphs
@@ Property / cites work: On Generating Triangle-Free Graphs / rank @@
+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 @@
+Adapted list coloring of planar graphs
@@ Property / cites work: Adapted list coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A top-down approach to search-trees: Improved algorithmics for 3-hitting set
+Normal rank
@@ Property / cites work @@
+On the number of edges of quadrilateral-free graphs
+Normal rank
@@ Property / cites work @@
+On the Turán number for the hexagon
@@ Property / cites work: On the Turán number for the hexagon / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Problem Kernels for NP-Hard Problems on Planar Graphs
+Normal rank
@@ Property / cites work @@
+Hypergraphs with no odd cycle of given length
@@ Property / cites work: Hypergraphs with no odd cycle of given length / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Subgraphs without Short Cycles
+Normal rank
@@ Property / cites work @@
+On a conjecture of Tuza about packing and covering of triangles
+Normal rank
@@ Property / cites work @@
+A Note on Bipartite Graphs Without 2 k -Cycles
@@ Property / cites work: A Note on Bipartite Graphs Without 2 k -Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Which Codes Have$4$-Cycle-Free Tanner Graphs?
@@ Property / cites work: Which Codes Have$4$-Cycle-Free Tanner Graphs? / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of triangle-free graphs of large minimum degree
+Normal rank
@@ Property / cites work @@
+On the chromatic number of pentagon-free graphs of large minimum degree
+Normal rank
@@ Property / cites work @@
+On the small cycle transversal of planar graphs
@@ Property / cites work: On the small cycle transversal of planar graphs / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:423937