VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS (Q3087098): Difference between revisions

@@ Property / cites work @@
+Introduction to Greedoids
@@ Property / cites work: Introduction to Greedoids / rank @@
+Normal rank
@@ Property / cites work @@
+Well-covered graphs and extendability
@@ Property / cites work: Well-covered graphs and extendability / rank @@
+Normal rank
@@ Property / cites work @@
+Independence numbers of graphs - an extension of the Koenig-Egervary theorem
+Normal rank
@@ Property / cites work @@
+Very well covered graphs
@@ Property / cites work: Very well covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unique Maximum Matching Algorithms
@@ Property / cites work: Unique Maximum Matching Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Uniquely restricted matchings
@@ Property / cites work: Uniquely restricted matchings / rank @@
+Normal rank
@@ Property / cites work @@
+A new greedoid: The family of local maximum stable sets of a forest
+Normal rank
@@ Property / cites work @@
+On \(\alpha^{+}\)-stable König-Egerváry graphs
@@ Property / cites work: On \(\alpha^{+}\)-stable König-Egerváry graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
+Normal rank
@@ Property / cites work @@
+Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Some covering concepts in graphs
@@ Property / cites work: Some covering concepts in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for well‐covered graphs
@@ Property / cites work: Complexity results for well‐covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the graphs in which the transversal number equals the matching number
+Normal rank