Knocking out \(P_k\)-free graphs (Q2352787): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2280813015
@@ Property / OpenAlex ID: W2280813015 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Eliminating graphs by means of parallel knock-out schemes
+Normal rank
@@ Property / cites work @@
+Upper bounds and algorithms for parallel knock-out numbers
+Normal rank
@@ Property / cites work @@
+The computational complexity of the parallel knock-out problem
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Decomposition Theory
@@ Property / cites work: A Combinatorial Decomposition Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Completely separable graphs
@@ Property / cites work: Completely separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Knocking Out P k -free Graphs
@@ Property / cites work: Knocking Out P k -free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Path factors and parallel knock-out schemes of almost claw-free graphs
+Normal rank
@@ Property / cites work @@
+Parallel Knockouts in the Complete Graph
@@ Property / cites work: Parallel Knockouts in the Complete Graph / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank