Search
Skip to Search Results
Filter
Subject / Keyword
Item type
Languages
Author / Creator / Contributor
Year
-
1994
Technical report TR94-02. A graph is said to be well covered if every maximal independent set has the same size, and very well covered if every maximal independent set contains exactly half the vertices in the graph. Well-covered graphs are of interest because while the problem of finding the...
1 - 1 of 1