Obtaining split graphs by edge contraction (Q897961): Difference between revisions

@@ Property / cites work @@
+Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Contracting Few Edges to Remove Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+Interval Deletion is Fixed-Parameter Tractable
@@ Property / cites work: Interval Deletion is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2k\) kernel for the cluster editing problem
@@ Property / cites work: A \(2k\) kernel for the cluster editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Incompressibility through Colors and IDs
@@ Property / cites work: Incompressibility through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Parameterized Algorithms for Deletion to Split Graphs
+Normal rank
@@ Property / cites work @@
+Increasing the minimum degree of a graph by contractions
+Normal rank
@@ Property / cites work @@
+Obtaining planarity by contracting few edges
@@ Property / cites work: Obtaining planarity by contracting few edges / rank @@
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for bipartite contraction
@@ Property / cites work: A faster FPT algorithm for bipartite contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
+Normal rank
@@ Property / cites work @@
+Contracting graphs to paths and trees
@@ Property / cites work: Contracting graphs to paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q2911626
@@ Property / cites work: Q2911626 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472526
@@ Property / cites work: Q4472526 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
+Normal rank