Maximum independent sets in subcubic graphs: new results (Q5919020): Difference between revisions

@@ Property / cites work @@
+Struction revisited
@@ Property / cites work: Struction revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth for graphs with small chordality
@@ Property / cites work: Treewidth for graphs with small chordality / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Sets of Maximum Weight in Apple-Free Graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Maximum independent sets in subcubic graphs: new results
+Normal rank
@@ Property / cites work @@
+From matchings to independent sets
@@ Property / cites work: From matchings to independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
+Normal rank
@@ Property / cites work @@
+Graphs without large apples and the maximum weight independent set problem
+Normal rank
@@ Property / cites work @@
+On the maximum independent set problem in subclasses of subcubic graphs
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Computing independent sets in graphs with large girth
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding clique cut-sets
@@ Property / cites work: An algorithm for finding clique cut-sets / rank @@
+Normal rank