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 math.COShow all

2 papers · 1 filter

math.CO2024

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) ⟶ R$ be a weight function. Then $G$ is $w$ -well-covered i…

math.CO2023

Recognizing $W_{2}$ Graphs

Vadim E. Levit, David Tankus

Let $G$ be a graph. A set $S \subseteq V (G)$ is independent if its elements are pairwise non-adjacent. A vertex $v \in V (G)$ is shedding if for every independent set $S \subseteq V…

Recognizing Relating Edges in Graphs without Cycles of Length 6

Recognizing W2​ Graphs

Recognizing $W_{2}$ Graphs