Independent sets in graphs without subtrees with many leaves (Q3186851): Difference between revisions

@@ Property / cites work @@
+Polynomial algorithm for finding the largest independent sets in graphs without forks
+Normal rank
@@ Property / cites work @@
+Q4272117
@@ Property / cites work: Q4272117 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115672
@@ Property / cites work: Q3115672 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115206
@@ Property / cites work: Q3115206 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds of the number of leaves of spanning trees
@@ Property / cites work: Bounds of the number of leaves of spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+Q4374992
@@ Property / cites work: Q4374992 / rank @@
+Normal rank