A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802): Difference between revisions

@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Triangle-Free Graphs on Surfaces
@@ Property / cites work: Coloring Triangle-Free Graphs on Surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5638352
@@ Property / cites work: Q5638352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3863917
@@ Property / cites work: Q3863917 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3872499
@@ Property / cites work: Q3872499 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the independence number in terms of the degrees
+Normal rank
@@ Property / cites work @@
+Greed is good: Approximating independent sets in sparse and bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Q4698692
@@ Property / cites work: Q4698692 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q5781249
@@ Property / cites work: Q5781249 / rank @@
+Normal rank