Well-covered claw-free graphs D Tankus, M Tarsi Journal of Combinatorial Theory, Series B 66 (2), 293-302, 1996 | 66 | 1996 |
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 | 52 | 1997 |
Well-covered graphs without cycles of lengths 4, 5 and 6 VE Levit, D Tankus Discrete Applied Mathematics 186, 158-167, 2015 | 13 | 2015 |
Weighted well-covered claw-free graphs VE Levit, D Tankus Discrete Mathematics 338 (3), 99-106, 2015 | 12 | 2015 |
On relating edges in graphs without cycles of length 4 VE Levit, D Tankus Journal of Discrete Algorithms 26, 28-33, 2014 | 12 | 2014 |
Weighted well-covered graphs without C4, C5, C6, C7 VE Levit, D Tankus Discrete Applied Mathematics 159 (5), 354-359, 2011 | 11 | 2011 |
Well-dominated graphs without cycles of lengths 4 and 5 VE Levit, D Tankus arXiv preprint arXiv:1409.1466, 2014 | 10 | 2014 |
On the recognition of k-equistable graphs VE Levit, M Milanič, D Tankus Graph-Theoretic Concepts in Computer Science, 286-296, 2012 | 10 | 2012 |
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 | 9 | 2009 |
Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests D Tankus, M Tarsi Discrete mathematics 307 (15), 1833-1843, 2007 | 7 | 2007 |
Complexity results on w-well-covered graphs VE Levit, D Tankus arXiv preprint arXiv:1401.0294, 2014 | 2 | 2014 |
Greedily constructing maximal partial f-factors D Tankus, M Tarsi Discrete Mathematics 309 (8), 2180-2189, 2009 | 1 | 2009 |
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 |