Q5092403 (Q5092403): Difference between revisions

@@ Property / cites work @@
+The most vital nodes with respect to independent set and vertex cover
+Normal rank
@@ Property / cites work @@
+Critical edges for the assignment problem: complexity and exact resolution
+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 @@
+Q3109939
@@ Property / cites work: Q3109939 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(d\)-blockers and \(d\)-transversals in graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction Blockers for Graphs with Forbidden Induced Paths
+Normal rank
@@ Property / cites work @@
+On the tractability of optimization problems on \(H\)-graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3094562
@@ Property / cites work: Q3094562 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum vertex blocker clique problem
@@ Property / cites work: Minimum vertex blocker clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
+Normal rank
@@ Property / cites work @@
+Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions
+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 @@
+The point-set embeddability problem for plane graphs
+Normal rank
@@ Property / cites work @@
+Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
+Normal rank