Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6

Vadim Levit, David Tankus

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if a…