Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547): Difference between revisions

@@ Property / arXiv ID @@
+.08050
@@ Property / arXiv ID: 1706.08050 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+The price of connectivity for feedback vertex set
@@ Property / cites work: The price of connectivity for feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+Independent feedback vertex sets for graphs of bounded diameter
+Normal rank
@@ Property / cites work @@
+Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
+Normal rank
@@ Property / cites work @@
+The Price of Connectivity for Vertex Cover
@@ Property / cites work: The Price of Connectivity for Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+The price of connectivity for dominating set: upper bounds and complexity
+Normal rank
@@ Property / cites work @@
+Connected vertex covers in dense graphs
@@ Property / cites work: Connected vertex covers in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+On Hadwiger's Number and the Stability Number
@@ Property / cites work: On Hadwiger's Number and the Stability Number / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
+Normal rank
@@ Property / cites work @@
+Connected Feedback Vertex Set in Planar Graphs
@@ Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The price of connectivity for cycle transversals
@@ Property / cites work: The price of connectivity for cycle transversals / rank @@
+Normal rank
@@ Property / cites work @@
+On Restricted Two-Factors
@@ Property / cites work: On Restricted Two-Factors / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+FPT algorithms for connected feedback vertex set
@@ Property / cites work: FPT algorithms for connected feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+On parameterized independent feedback vertex set
@@ Property / cites work: On parameterized independent feedback vertex set / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary classes for graph problems involving non-local properties
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Connecting face hitting sets in planar graphs
@@ Property / cites work: Connecting face hitting sets in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+On enumerating all minimal solutions of feedback problems
+Normal rank
@@ Property / cites work @@
+Q3318125
@@ Property / cites work: Q3318125 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
+Normal rank
@@ Property / cites work @@
+Perfect connected-dominant graphs
@@ Property / cites work: Perfect connected-dominant graphs / rank @@
+Normal rank