Recognizing Relating Edges in Graphs without Cycles of Length 6

Vadim E. Levit, David Tankus

A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w:V(G)⟶\mathbb{R}$ be a weight function. Then $G$ is $w$-well-covered i…