Q5005166 (Q5005166): Difference between revisions

@@ 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 @@
+Recognizing Graphs Close to Bipartite Graphs
@@ Property / cites work: Recognizing Graphs Close to Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Feedback Vertex Set for P_5-free Graphs
+Normal rank
@@ Property / cites work @@
+A note on an induced subgraph characterization of domination perfect 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 @@
+Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
+Normal rank
@@ Property / cites work @@
+Uniquely Colourable Graphs and  the Hardness of Colouring Graphs  of Large Girth
+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 @@
+Connected vertex cover for \((sP_1+P_5)\)-free graphs
+Normal rank