Well-Covered Claw-Free Graphs. - David Tankus; Michael Tarsi (J. Comb. Theory B, 1996)

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems. - David Tankus; Michael Tarsi (J. Comb. Theory B, 1997)

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. - David Tankus; Michael Tarsi (Discret. Math., 2007)

On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. - Vadim E. Levit; David Tankus (Graph Theory, Computational Intelligence and Thought, 2009)

Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 - Vadim E. Levit; David Tankus (CoRR, 2009)

Greedily constructing maximal partial f-factors. - David Tankus; Michael Tarsi (Discret. Math., 2009)

Weighted well-covered graphs without C4, C5, C6, C7. - Vadim E. Levit; David Tankus (Discret. Appl. Math., 2011)

Lower Bounds on the Odds Against Tree Spectral Sets. - Vadim E. Levit; David Tankus (Electron. Notes Discret. Math., 2011)

On the Recognition of k-Equistable Graphs. - Vadim E. Levit; Martin Milanic; David Tankus (WG, 2012)

Complexity results on w-well-covered graphs. - Vadim E. Levit; David Tankus (CoRR, 2014)

On relating edges in graphs without cycles of length 4. - Vadim E. Levit; David Tankus (J. Discrete Algorithms, 2014)

Well-covered graphs without cycles of lengths 4, 5 and 6. - Vadim E. Levit; David Tankus (Discret. Appl. Math., 2015)

Weighted well-covered claw-free graphs. - Vadim E. Levit; David Tankus (Discret. Math., 2015)

Well-dominated graphs without cycles of lengths 4 and 5. - Vadim E. Levit; David Tankus (Discret. Math., 2017)

Complexity Results for Generating Subgraphs. - Vadim E. Levit; David Tankus (Algorithmica, 2018)

Generating subgraphs in chordal graphs. - Vadim E. Levit; David Tankus (CoRR, 2018)

Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7. - David Tankus (Discret. Appl. Math., 2020)

Recognizing Generating Subgraphs Revisited. - Vadim E. Levit; David Tankus (Int. J. Found. Comput. Sci., 2021)

Weighted well-covered graphs without cycles of lengths 5, 6 and 7. - David Tankus (Inf. Process. Lett., 2022)

Recognizing W2 Graphs. - Vadim E. Levit; David Tankus (CoRR, 2023)

Well-Covered Graphs With Constraints On Δ And δ. - Vadim E. Levit; David Tankus (Theory Comput. Syst., 2023)

Recognizing $ mathbf {W_2}$ Graphs. - Vadim E. Levit; David Tankus (Graphs Comb., 2024)

Recognizing Relating Edges in Graphs Without Cycles of Length 6. - Vadim E. Levit; David Tankus (Graphs Comb., 2025)