On irregular total labellings M Bača, S Jendroľ, M Miller, J Ryan Discrete Mathematics 307 (11), 1378-1388, 2007 | 445 | 2007 |
Total edge irregularity strength of trees J Ivančo, S Jendroľ Discussiones Mathematicae Graph Theory 26 (3), 449, 2006 | 169 | 2006 |
Light subgraphs of graphs embedded in the plane—A survey S Jendroľ, HJ Voss Discrete Mathematics 313 (4), 406-421, 2013 | 125 | 2013 |
Conjectures and open problems on face antimagic evaluations of graphs M Bača, ET Baskoro, YM Cholili, S Jendroľ, Y Lin, M Miller, J Ryan, ... Journal of Indonesian Math. Soc. 11 (2), 175-192, 2005 | 109* | 2005 |
On light subgraphs in plane graphs of minimum degree five. S Jendroľ, T Madaras Discussiones Mathematicae Graph Theory 16 (2), 207-217, 1996 | 86 | 1996 |
Total edge irregularity strength of complete graphs and complete bipartite graphs J Miškuf, R Soták Electronic notes in discrete mathematics 28, 281-285, 2007 | 83 | 2007 |
On the crossing numbers of Sm× Pn and Sm× Cn S Jendrol, M Šcerbová Casopis pro pestování matematiky 107, 225-230, 1982 | 73 | 1982 |
Subgraphs with restricted degrees of their vertices in planar 3-connected graphs I Fabrici, S Jendroľ Graphs and Combinatorics 13 (3), 245-250, 1997 | 59 | 1997 |
On a conjecture by Plummer and Toft M Horňák, S Jendroľ Journal of Graph Theory 30 (3), 177-189, 1999 | 55* | 1999 |
On light cycles in plane triangulations S Jendroľ, T Madaras, R Soták, Z Tuza Discrete mathematics 197, 453-467, 1999 | 48 | 1999 |
On total edge irregularity strength of the grids J Miškuf, S Jendroľ Tatra Mountains Mathematical Publications 36, 147-151, 2007 | 47 | 2007 |
A structural property of convex 3-polytopes S Jendrol Geometriae Dedicata 68 (1), 91-99, 1997 | 43 | 1997 |
The irregularity strength and cost of the union of cliques S Jendroľ, M Tkáč, Z Tuza Discrete Mathematics 150 (1-3), 179-186, 1996 | 43 | 1996 |
Total vertex irregular labeling of complete bipartite graphs K Wijaya, Slamin, Surahmat, S Jendroľ JCMCC 55, 129-136, 2005 | 42 | 2005 |
Cyclic chromatic number of 3-connected plane graphs H Enomoto, M Hornák, S Jendrol' SIAM Journal on Discrete Mathematics 14 (1), 121-137, 2001 | 39 | 2001 |
Describing short paths in plane graphs of girth at least 5 S Jendrol, M Maceková Discrete Mathematics 338 (2), 149-158, 2015 | 37 | 2015 |
Conflict-free connections of graphs J Czap, S Jendroľ, J Valiska Discussiones mathematicae graph theory 38 (4), 911-920, 2018 | 34 | 2018 |
Rainbow numbers for cycles in plane triangulations M Horňák, S Jendrol′, I Schiermeyer, R Soták Journal of Graph Theory 78 (4), 248-257, 2015 | 34 | 2015 |
Nonrepetitive vertex colorings of graphs J Harant, S Jendroľ Discrete Mathematics 312 (2), 374-380, 2012 | 34 | 2012 |
Rainbow numbers for matchings in plane triangulations I Schiermeyer, J Tu Discrete Mathematics 331, 158-164, 2014 | 33 | 2014 |