1 citations · 1 across the 7 of their papers we have counts for
8 papers · 1 filter
Recognizing generating subgraphs revisited
Vadim E. Levit, David Tankus
A graph is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function is defined on its vertices. Then is -well-cove…
Generating subgraphs in chordal graphs
Vadim E. Levit, David Tankus
A graph is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function is defined on its vertices. Then is -well-cove…
Well-dominated graphs without cycles of lengths 4 and 5
Vadim E. Levit, David Tankus
Let be a graph. A set of vertices in dominates the graph if every vertex of is either in or a neighbor of a vertex in . Finding a minimal cardinality set whi…
Complexity results for generating subgraphs
Vadim E. 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…
Weighted Well-Covered Claw-Free Graphs
Vadim E. 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…
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…