Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2020.112169
@@ Property / DOI: 10.1016/j.disc.2020.112169 / rank @@
-Normal rank
@@ Property / author @@
+Esther Galby
@@ Property / author: Esther Galby / 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.disc.2020.112169
+Normal rank
@@ Property / OpenAlex ID @@
+W3092286751
@@ Property / OpenAlex ID: W3092286751 / rank @@
+Normal rank
@@ 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 @@
+Vertex domination‐critical graphs
@@ Property / cites work: Vertex domination‐critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination dot-critical graphs
@@ Property / cites work: Domination dot-critical 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 @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / 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 @@
+Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q5009589
@@ Property / cites work: Q5009589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5092403
@@ Property / cites work: Q5092403 / 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 @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / 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 @@
+Domination critical graphs
@@ Property / cites work: Domination critical graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2020.112169
@@ Property / DOI: 10.1016/J.DISC.2020.112169 / rank @@
+Normal rank