Seguir
David Tankus
David Tankus
Faculty member in Ariel University, Israel
E-mail confirmado em ariel.ac.il
Título
Citado por
Citado por
Ano
Well-covered claw-free graphs
D Tankus, M Tarsi
Journal of Combinatorial Theory, Series B 66 (2), 293-302, 1996
661996
The structure of well-covered graphs and the complexity of their recognition problems
D Tankus, M Tarsi
Journal of Combinatorial Theory, Series B 69 (2), 230-233, 1997
521997
Well-covered graphs without cycles of lengths 4, 5 and 6
VE Levit, D Tankus
Discrete Applied Mathematics 186, 158-167, 2015
132015
Weighted well-covered claw-free graphs
VE Levit, D Tankus
Discrete Mathematics 338 (3), 99-106, 2015
122015
On relating edges in graphs without cycles of length 4
VE Levit, D Tankus
Journal of Discrete Algorithms 26, 28-33, 2014
122014
Weighted well-covered graphs without C4, C5, C6, C7
VE Levit, D Tankus
Discrete Applied Mathematics 159 (5), 354-359, 2011
112011
Well-dominated graphs without cycles of lengths 4 and 5
VE Levit, D Tankus
arXiv preprint arXiv:1409.1466, 2014
102014
On the recognition of k-equistable graphs
VE Levit, M Milanič, D Tankus
Graph-Theoretic Concepts in Computer Science, 286-296, 2012
102012
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
VE Levit, D Tankus
Graph Theory, Computational Intelligence and Thought, 144-147, 2009
92009
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests
D Tankus, M Tarsi
Discrete mathematics 307 (15), 1833-1843, 2007
72007
Complexity results on w-well-covered graphs
VE Levit, D Tankus
arXiv preprint arXiv:1401.0294, 2014
22014
Greedily constructing maximal partial f-factors
D Tankus, M Tarsi
Discrete Mathematics 309 (8), 2180-2189, 2009
12009
Lower Bounds on the Odds against Tree Spectral Sets
VE Levit, D Tankus
Electronic Notes in Discrete Mathematics 38, 559-564, 2011
2011
Lower Bounds on the Ratio of Spectral Sets
VE Levit, D Tankus
11th Haifa Workshop on Interdisciplinary Applications of Graph Theory …, 2011
2011
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–14