2 search results - page 1 / 1 » Well-covered Graphs and Greedoids |
COMBINATORICS
2004
13 years 5 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
CATS
2008
13 years 6 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...