1 citations · 1 across the 7 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
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…
cs.DM2009★ 1 cited
Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7
Vadim E. Levit, David Tankus
A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight f…