Reducing the vertex cover number via edge contractions (Q6098145): Difference between revisions

@@ Property / cites work @@
+On the parameterized complexity of contraction to generalization of trees
+Normal rank
@@ Property / cites work @@
+Paths to trees and cacti
@@ Property / cites work: Paths to trees and cacti / rank @@
+Normal rank
@@ Property / cites work @@
+Split Contraction
@@ Property / cites work: Split Contraction / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers for the stability number and the chromatic number
+Normal rank
@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of three edge contraction problems with degree constraints
+Normal rank
@@ Property / cites work @@
+Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
+Normal rank
@@ Property / cites work @@
+Contracting Few Edges to Remove Forbidden Induced Subgraphs
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(d\)-blockers and \(d\)-transversals in graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Using edge contractions to reduce the semitotal domination number
+Normal rank
@@ Property / cites work @@
+Reducing the domination number of graphs via edge contractions and vertex deletions
+Normal rank
@@ Property / cites work @@
+Blocking total dominating sets via edge contractions
+Normal rank
@@ Property / cites work @@
+Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction
+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 @@
+Contracting graphs to paths and trees
@@ Property / cites work: Contracting graphs to paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a Bipartite Graph by Contracting Few Edges
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for constant diameter augmentation problems
+Normal rank
@@ Property / cites work @@
+An FPT algorithm for contraction to cactus
@@ Property / cites work: An FPT algorithm for contraction to cactus / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Reducing graph transversals via edge contractions
@@ Property / cites work: Reducing graph transversals via edge contractions / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
+Normal rank
@@ Property / cites work @@
+Minimum vertex blocker clique problem
@@ Property / cites work: Minimum vertex blocker clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of disconnected cut and \(2 K_2\)-partition
+Normal rank
@@ Property / cites work @@
+Q2904774
@@ Property / cites work: Q2904774 / rank @@
+Normal rank
@@ Property / cites work @@
+Critical vertices and edges in \(H\)-free graphs
@@ Property / cites work: Critical vertices and edges in \(H\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity Of Grid Contraction
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity of Contraction to Generalization of Trees.
+Normal rank
@@ Property / cites work @@
+On the NP-hardness of edge-deletion and -contraction problems
+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