Using edge contractions to reduce the semitotal domination number (Q2098176): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2022.10.020
@@ Property / DOI: 10.1016/j.tcs.2022.10.020 / rank @@
-Normal rank
@@ Property / author @@
-Esther Galby
@@ Property / author: Esther Galby / 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 / OpenAlex ID @@
+W3180032410
@@ Property / OpenAlex ID: W3180032410 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03755
@@ Property / arXiv ID: 2107.03755 / 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 @@
+Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
+Normal rank
@@ Property / cites work @@
+Nonempty intersection of longest paths in series-parallel graphs
+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 @@
+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 @@
+Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
+Normal rank
@@ Property / cites work @@
+Q2878209
@@ Property / cites work: Q2878209 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3094562
@@ Property / cites work: Q3094562 / rank @@
+Normal rank
@@ Property / cites work @@
+Blockers for simple Hamiltonian paths in convex geometric graphs of even order
+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 @@
+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 @@
+Exact algorithms for the minimum cost vertex blocker clique problem
+Normal rank
@@ Property / cites work @@
+Minimum edge blocker dominating set problem
@@ Property / cites work: Minimum edge blocker dominating set 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 @@
+Transversals of Longest Paths and Cycles
@@ Property / cites work: Transversals of Longest Paths and Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Matching interdiction
@@ Property / cites work: Matching interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Network flow interdiction on planar graphs
@@ Property / cites work: Network flow interdiction on planar graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2022.10.020
@@ Property / DOI: 10.1016/J.TCS.2022.10.020 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2098176