On the Independence Number of Graphs with Maximum Degree 3 (Q3104780): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-25870-1_22
+Normal rank
@@ Property / OpenAlex ID @@
+W1921482839
@@ Property / OpenAlex ID: W1921482839 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation properties of the independent set problem for low degree graphs
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Q3872499
@@ Property / cites work: Q3872499 / rank @@
+Normal rank
@@ Property / cites work @@
+/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
+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 @@
+The independence number in graphs of maximum degree three
+Normal rank
@@ Property / cites work @@
+A new proof of the independence ratio of triangle-free cubic graphs
+Normal rank
@@ Property / cites work @@
+Size and independence in triangle‐free graphs with maximum degree three
+Normal rank
@@ Property / cites work @@
+Some Ramsey-Type Numbers and the Independence Ratio
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
+Normal rank