1-extendability of independent sets (Q2169951): Difference between revisions

@@ Property / cites work @@
+Q2832241
@@ Property / cites work: Q2832241 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Binary Space Partitions in the Plane
@@ Property / cites work: Optimal Binary Space Partitions in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q3919752
@@ Property / cites work: Q3919752 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of independent set in H-free graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Independent Set in H-Free Graphs.
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
+Normal rank
@@ Property / cites work @@
+Well-covered graphs and extendability
@@ Property / cites work: Well-covered graphs and extendability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4622618
@@ Property / cites work: Q4622618 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs
+Normal rank
@@ Property / cites work @@
+The matching extension problem in general graphs is co-NP-complete
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Face covers and the genus problem for apex graphs
@@ Property / cites work: Face covers and the genus problem for apex graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some covering concepts in graphs
@@ Property / cites work: Some covering concepts in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extending matchings in graphs: A survey
@@ Property / cites work: Extending matchings in graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941453
@@ Property / cites work: Q3941453 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179024
@@ Property / cites work: Q4179024 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for well‐covered graphs
@@ Property / cites work: Complexity results for well‐covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Well-covered claw-free graphs
@@ Property / cites work: Well-covered claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank