David Tankus

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Recognizing $\text{W}_2$ graphs Graphs and Combinatorics	2024-07-29	Paper
Well-covered graphs with constraints on $\Delta$ and $\delta$ Theory of Computing Systems	2024-01-08	Paper
Recognizing $\mathbf{W_2}$ Graphs	2023-06-29	Paper
Weighted well-covered graphs without cycles of lengths 5, 6 and 7 Information Processing Letters	2021-12-14	Paper
Recognizing generating subgraphs revisited International Journal of Foundations of Computer Science	2021-04-19	Paper
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 Discrete Applied Mathematics	2020-06-29	Paper
Generating subgraphs in chordal graphs	2018-11-11	Paper
Complexity results for generating subgraphs Algorithmica	2018-07-25	Paper
Well-dominated graphs without cycles of lengths 4 and 5 Discrete Mathematics	2017-05-22	Paper
Well-covered graphs without cycles of lengths 4, 5 and 6 Discrete Applied Mathematics	2015-05-22	Paper
Weighted well-covered claw-free graphs Discrete Mathematics	2014-12-19	Paper
On relating edges in graphs without cycles of length 4 Journal of Discrete Algorithms	2014-04-28	Paper
Lower bounds on the odds against tree spectral sets	2013-11-01	Paper
On the recognition of $k$-equistable graphs Graph-Theoretic Concepts in Computer Science	2012-11-06	Paper
Weighted well-covered graphs without $C_{4}, C_{5}, C_{6}, C_{7}$ Discrete Applied Mathematics	2011-03-10	Paper
On related edges in well-covered graphs without cycles of length 4 and 6 Graph Theory, Computational Intelligence and Thought	2010-01-07	Paper
Greedily constructing maximal partial $f$-factors Discrete Mathematics	2009-06-19	Paper
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests Discrete Mathematics	2007-05-23	Paper
The structure of well-covered graphs and the complexity of their recognition problems Journal of Combinatorial Theory. Series B	1997-10-26	Paper
Well-covered claw-free graphs Journal of Combinatorial Theory. Series B	1997-03-23	Paper
Recognizing Relating Edges in Graphs without Cycles of Length 6 (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: David Tankus

Publication	Date of Publication	Type
Recognizing \(\text{W}_2\) graphs Graphs and Combinatorics	2024-07-29	Paper
Well-covered graphs with constraints on \(\Delta\) and \(\delta\) Theory of Computing Systems	2024-01-08	Paper
Recognizing $\mathbf{W_2}$ Graphs	2023-06-29	Paper
Weighted well-covered graphs without cycles of lengths 5, 6 and 7 Information Processing Letters	2021-12-14	Paper
Recognizing generating subgraphs revisited International Journal of Foundations of Computer Science	2021-04-19	Paper
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 Discrete Applied Mathematics	2020-06-29	Paper
Generating subgraphs in chordal graphs	2018-11-11	Paper
Complexity results for generating subgraphs Algorithmica	2018-07-25	Paper
Well-dominated graphs without cycles of lengths 4 and 5 Discrete Mathematics	2017-05-22	Paper
Well-covered graphs without cycles of lengths 4, 5 and 6 Discrete Applied Mathematics	2015-05-22	Paper
Weighted well-covered claw-free graphs Discrete Mathematics	2014-12-19	Paper
On relating edges in graphs without cycles of length 4 Journal of Discrete Algorithms	2014-04-28	Paper
Lower bounds on the odds against tree spectral sets	2013-11-01	Paper
On the recognition of \(k\)-equistable graphs Graph-Theoretic Concepts in Computer Science	2012-11-06	Paper
Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) Discrete Applied Mathematics	2011-03-10	Paper
On related edges in well-covered graphs without cycles of length 4 and 6 Graph Theory, Computational Intelligence and Thought	2010-01-07	Paper
Greedily constructing maximal partial \(f\)-factors Discrete Mathematics	2009-06-19	Paper
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests Discrete Mathematics	2007-05-23	Paper
The structure of well-covered graphs and the complexity of their recognition problems Journal of Combinatorial Theory. Series B	1997-10-26	Paper
Well-covered claw-free graphs Journal of Combinatorial Theory. Series B	1997-03-23	Paper
Recognizing Relating Edges in Graphs without Cycles of Length 6 (available as arXiv preprint)	N/A	Paper