- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- David Tankus, Michael Tarsi
- J. Comb. Theory, Ser. B
- 1996

We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic toK1.3, is well covered. A graph is well-covered if all its maximal independent sets… (More)

- David Tankus, Michael Tarsi
- J. Comb. Theory, Ser. B
- 1997

A graph is well-covered if all its maximal independent sets are of the same cardinality. Deciding whether a given graph is well-covered is known to beNP-hard in general, and solvable in polynomial… (More)

- Vadim E. Levit, Martin Milanič, David Tankus
- WG
- 2012

A graph G=(V,E) is called equistable if there exist a positive integer t and a weight function $w:V \longrightarrow \mathbb{N}$ such that S⊆V is a maximal stable set of G if and only if w(S)=t. The… (More)

- Vadim E. Levit, David Tankus
- J. Discrete Algorithms
- 2009

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-complete problem to… (More)

- David Tankus, Michael Tarsi
- Discrete Mathematics
- 2007

There are various greedy schemas to construct a maximal path in a given input graph. Associated with each such schema is the family of graphs where it always results a path of maximum length, or a… (More)

- Vadim E. Levit, David Tankus
- Graph Theory, Computational Intelligence and…
- 2009

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-NPC. The complexity status of the problem is not… (More)

- Vadim E. Levit, David Tankus
- Discrete Applied Mathematics
- 2012

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 all maximal… (More)

- Vadim E. Levit, David Tankus
- Discrete Mathematics
- 2013

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 all maximal… (More)

- Vadim E. Levit, David Tankus
- Algorithmica
- 2014

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 all maximal… (More)