David Tankus

activity

20092024

most citedWeighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing 2018 · cs.DMShow all

2 papers · 2 filters

cs.DM2018

Recognizing generating subgraphs revisited

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-cove…

cs.DM2018

Generating subgraphs in chordal 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-cove…