2 papers
cs.DM2012
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…
cs.DM2009
On Relating Edges in Graphs without Cycles of Length 4
Vadim E. Levit, David Tankus
An edge xy is relating in the graph G if there is an independent set S, containing neither x nor y, such that S_{x} and S_{y} are both maximal independent sets in G. It is an NP-co…