Eliminating graphs by means of parallel knock-out schemes (Q867852): Difference between revisions

@@ Property / cites work @@
+The Computational Complexity of the Parallel Knock-Out Problem
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Claw-free graphs---a survey
@@ Property / cites work: Claw-free graphs---a survey / rank @@
+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 @@
+Q4074931
@@ Property / cites work: Q4074931 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3348939
@@ Property / cites work: Q3348939 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with 1-Factors
@@ Property / cites work: Graphs with 1-Factors / rank @@
+Normal rank