Factorization of complete graphs into three factors with the smallest diameter equal to 3 or 4. - Tomás Vetrík (Australas. J Comb., 2007)

Large vertex-transitive and Cayley graphs with given degree and diameter. - Jana Siagiová; Tomás Vetrík (Electron. Notes Discret. Math., 2007)

An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles. - Tomás Vetrík (Discuss. Math. Graph Theory, 2008)

On Ramsey (K1, 2, C4)-minimal graphs. - Edy Tri Baskoro; Tomás Vetrík; Lyra Yulianti (Discuss. Math. Graph Theory, 2010)

Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. - Heather Macbeth; Jana Siagiová; Jozef Sirán; Tomás Vetrík (J. Graph Theory, 2010)

Large bipartite Cayley graphs of given degree and diameter. - Tomás Vetrík; Rinovia Simanjuntak; Edy Tri Baskoro (Discret. Math., 2011)

Large Cayley digraphs of given degree and diameter. - Tomás Vetrík (Discret. Math., 2012)

List coloring of complete multipartite graphs. - Tomás Vetrík (Discuss. Math. Graph Theory, 2012)

Cayley graphs of given degree and diameters 3, 4 and 5. - Tomás Vetrík (Discret. Math., 2013)

Universal Graphs for Two Graph Properties. - Izak Broere; Tomás Vetrík (Ars Comb., 2014)

On the Gutman index and minimum degree. - Jaya Percival Mazorodze; Simon Mukwembi; Tomás Vetrík (Discret. Appl. Math., 2014)

Abelian Cayley Graphs of Given Degree and Diameter 2 and 3. - Tomás Vetrík (Graphs Comb., 2014)

The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. - Peter Dankelmann; Tomás Vetrík (J. Graph Theory, 2014)

The Gutman index and the edge-Wiener index of graphs with given vertex-connectivity. - Jaya Percival Mazorodze; Simon Mukwembi; Tomás Vetrík (Discuss. Math. Graph Theory, 2016)

On the metric dimension of circulant graphs with $4$ generators. - Tomás Vetrík (Contributions Discret. Math., 2017)

Large Cayley digraphs and bipartite Cayley digraphs of odd diameters. - Marcel Abas; Tomás Vetrík (Discret. Math., 2017)

The degree-diameter problem for outerplanar graphs. - Peter Dankelmann; Elizabeth Jonck; Tomás Vetrík (Discuss. Math. Graph Theory, 2017)

Computing the metric dimension of the categorial product of some graphs. - Tomás Vetrík; Ali Ahmad 003 (Int. J. Comput. Math., 2017)

A note on the Ramsey numbers for theta graphs versus the wheel of order 5. - Mohammed M. M. Jaradat; Mohammad Saleh Bataineh; Tomás Vetrík; Ayat M. M. Rabaiah (AKCE Int. J. Graphs Comb., 2018)

General multiplicative Zagreb indices of trees. - Tomás Vetrík; Selvaraj Balachandran (Discret. Appl. Math., 2018)

General Multiplicative Zagreb Indices of Graphs With Bridges. - Monther Rashed Alfuraidan; Muhammad Imran 006; Muhammad Kamran Jamil; Tomás Vetrík (IEEE Access, 2020)

General eccentric connectivity index of trees and unicyclic graphs. - Tomás Vetrík; Mesfin Masre (Discret. Appl. Math., 2020)

Distance-based indices of complete m-ary trees. - Mesfin Masre; Samuel Asefa Fufa; Tomás Vetrík (Discret. Math. Algorithms Appl., 2020)

On the metric dimension of directed and undirected circulant graphs. - Tomás Vetrík (Discuss. Math. Graph Theory, 2020)

General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number. - Tomás Vetrík; Selvaraj Balachandran (J. Comb. Optim., 2020)

General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles. - Monther R. Alfuraidan; Tomás Vetrík; Selvaraj Balachandran (Symmetry, 2020)

Metric dimension of Cayley digraphs of split metacyclic groups. - Marcel Abas; Tomás Vetrík (Theor. Comput. Sci., 2020)

General sum-connectivity index of unicyclic graphs with given diameter. - Monther Rashed Alfuraidan; Kinkar Chandra Das; Tomás Vetrík; Selvaraj Balachandran (Discret. Appl. Math., 2021)

General eccentric distance sum of graphs. - Tomás Vetrík (Discret. Math. Algorithms Appl., 2021)

General Randić index of unicyclic graphs with given diameter. - Monther Rashed Alfuraidan; Kinkar Chandra Das; Tomás Vetrík; Selvaraj Balachandran (Discret. Appl. Math., 2022)

General sum-connectivity index of unicyclic graphs with given diameter and girth. - Tomás Vetrík (Discret. Math. Algorithms Appl., 2022)

Zeroth-order general Randić index of trees with given distance k-domination number. - Tomás Vetrík; Mesfin Masre; Selvaraj Balachandran (Electron. J. Graph Theory Appl., 2022)

General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index. - Tomás Vetrík (Electron. J. Graph Theory Appl., 2023)

Eccentric connectivity coindex of bipartite graphs. - Tomás Vetrík; Mesfin Masre; Selvaraj Balachandran (Discret. Math. Algorithms Appl., 2023)

General Randić index of trees with given number of branching vertices. - Tomás Vetrík (Discret. Math. Algorithms Appl., 2023)

Degree-based function index for graphs with given diameter. - Tomás Vetrík (Discret. Appl. Math., 2023)

General sum-connectivity index of unicyclic graphs with given maximum degree. - Elize Swartz; Tomás Vetrík (Discret. Appl. Math., 2025)

Degree-based function index of trees and unicyclic graphs. - Tomás Vetrík (J. Appl. Math. Comput., 2025)