Sciweavers

CATS
2008
14 years 13 days ago
Well-covered Graphs and Greedoids
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...
Vadim E. Levit, Eugen Mandrescu