Tomás Vetrík
Orcid: 0000-0002-0387-7276
According to our database1,
Tomás Vetrík
authored at least 37 papers
between 2007 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
1
4
3
2
7
2
4
1
4
1
2
1
2
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Discret. Appl. Math., 2025
2023
Discret. Appl. Math., July, 2023
Discret. Math. Algorithms Appl., May, 2023
Discret. Math. Algorithms Appl., January, 2023
General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index.
Electron. J. Graph Theory Appl., 2023
2022
Electron. J. Graph Theory Appl., 2022
Discret. Math. Algorithms Appl., 2022
Discret. Appl. Math., 2022
2021
Discret. Appl. Math., 2021
2020
Theor. Comput. Sci., 2020
Symmetry, 2020
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number.
J. Comb. Optim., 2020
Discuss. Math. Graph Theory, 2020
Discret. Math. Algorithms Appl., 2020
Discret. Appl. Math., 2020
2018
AKCE Int. J. Graphs Comb., 2018
2017
Int. J. Comput. Math., 2017
Discuss. Math. Graph Theory, 2017
Discret. Math., 2017
Contributions Discret. Math., 2017
2016
Discuss. Math. Graph Theory, 2016
2014
J. Graph Theory, 2014
Universal Graphs for Two Graph Properties.
Ars Comb., 2014
2013
2012
2011
2010
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter.
J. Graph Theory, 2010
Discuss. Math. Graph Theory, 2010
2008
An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles.
Discuss. Math. Graph Theory, 2008
2007
Electron. Notes Discret. Math., 2007
Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4.
Australas. J Comb., 2007