David Tankus

Graphs Comb., June, 2025

2024

Recognizing $\mathbf {W_2}$ Graphs.

[BibT_eX]

[DOI]

Graphs Comb., August, 2024

2023

Well-Covered Graphs With Constraints On Δ And δ.

[BibT_eX]

[DOI]

Theory Comput. Syst., December, 2023

Recognizing W2 Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Weighted well-covered graphs without cycles of lengths 5, 6 and 7.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

2021

Recognizing Generating Subgraphs Revisited.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

2020

Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

Generating subgraphs in chordal graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Complexity Results for Generating Subgraphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Well-dominated graphs without cycles of lengths 4 and 5.

[BibT_eX]

[DOI]

Discret. Math., 2017

2015

Weighted well-covered claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Well-covered graphs without cycles of lengths 4, 5 and 6.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

On relating edges in graphs without cycles of length 4.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Complexity results on w-well-covered graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2012

On the Recognition of k-Equistable Graphs.

[BibT_eX]

[DOI]

Martin Milanic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Lower Bounds on the Odds Against Tree Spectral Sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Weighted well-covered graphs without C4, C5, C6, C7.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2009

Greedily constructing maximal partial f-factors.

[BibT_eX]

[DOI]

Discret. Math., 2009

Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7

[BibT_eX]

[DOI]

CoRR, 2009

On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

2007

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests.

[BibT_eX]

[DOI]

Discret. Math., 2007

1997

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

1996

Well-Covered Claw-Free Graphs.

[BibT_eX]

[DOI]