Combinatorial properties of the family of maximum stable sets of a graph (Q1348387): Difference between revisions

@@ Property / cites work @@
+Q3919752
@@ Property / cites work: Q3919752 / rank @@
+Normal rank
@@ Property / cites work @@
+Independence numbers of graphs - an extension of the Koenig-Egervary theorem
+Normal rank
@@ Property / cites work @@
+Graphs whose vertex independence number is unaffected by single edge addition or deletion
+Normal rank
@@ Property / cites work @@
+Q3472128
@@ Property / cites work: Q3472128 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertices Belonging to All or to No Maximum Stable Sets of a Graph
+Normal rank
@@ Property / cites work @@
+Q4393354
@@ Property / cites work: Q4393354 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2718374
@@ Property / cites work: Q2718374 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489216
@@ Property / cites work: Q4489216 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the graphs in which the transversal number equals the matching number
+Normal rank
@@ Property / cites work @@
+The structure and maximum number of maximum independent sets in trees
+Normal rank