| Recognizing Cartesian products in linear time W Imrich, I Peterin Discrete Mathematics 307 (3-5), 472-483, 2007 | 93 | 2007 |
| Edge metric dimension of some graph operations I Peterin, IG Yero Bulletin of the Malaysian Mathematical Sciences Society 43 (3), 2465-2477, 2020 | 79 | 2020 |
| Game chromatic number of Cartesian product graphs T Bartnicki, B Brešar, J Grytczuk, M Kovše, Z Miechowicz, I Peterin the electronic journal of combinatorics, R72-R72, 2008 | 67 | 2008 |
| Nonrepetitive colorings of trees B Brešar, J Grytczuk, S Klavžar, S Niwczyk, I Peterin Discrete Mathematics 307 (2), 163-172, 2007 | 63 | 2007 |
| Strongly distance-balanced graphs and graph products K Balakrishnan, M Changat, I Peterin, S Špacapan, P Šparl, ... European Journal of Combinatorics 30 (5), 1048-1053, 2009 | 59 | 2009 |
| Convex sets in lexicographic products of graphs BS Anand, M Changat, S Klavžar, I Peterin Graphs and Combinatorics 28 (1), 77-84, 2012 | 55 | 2012 |
| Efficient open domination in graph products D Kuziak, I Peterin, IG Yero Discrete Mathematics and Theoretical Computer Science 16 (1), 105--120, 2014 | 39 | 2014 |
| Efficient open domination in graph products D Kuziak, I Peterin, IG Yero Discrete Mathematics and Theoretical Computer Science 16 (1), 105--120, 2014 | 37 | 2014 |
| The b-chromatic number and related topics—A survey M Jakovac, I Peterin Discrete Applied Mathematics 235, 184-201, 2018 | 36 | 2018 |
| Characterizing subgraphs of Hamming graphs S Klavžar, I Peterin Journal of Graph Theory 49 (4), 302-312, 2005 | 36 | 2005 |
| Toll convexity L Alcón, B Brešar, T Gologranc, M Gutierrez, TK Šumenjak, I Peterin, ... European Journal of Combinatorics 46, 161-175, 2015 | 32 | 2015 |
| Rainbow connection and graph products T Gologranc, G Mekiš, I Peterin Graphs and Combinatorics 30, 591-607, 2014 | 30 | 2014 |
| Hamming dimension of a graph—The case of Sierpiński graphs S Klavžar, I Peterin, SS Zemljič European Journal of Combinatorics 34 (2), 460-473, 2013 | 27 | 2013 |
| Distance magic labeling and two products of graphs M Anholcer, S Cichacz, I Peterin, A Tepeh Graphs and Combinatorics 31 (5), 1125-1136, 2015 | 25 | 2015 |
| On the b-chromatic number of some graph products M Jakovac, I Peterin Studia Scientiarum Mathematicarum Hungarica 49 (2), 156-169, 2012 | 25 | 2012 |
| On the b-chromatic number of some graph products M Jakovac, I Peterin Studia Scientiarum Mathematicarum Hungarica 49 (2), 156-169, 2012 | 25 | 2012 |
| On the b-chromatic number of some graph products I Peterin, M Jakovac Studia scientiarum mathematicarum Hungarica 2 (49), 156-169, 2012 | 25* | 2012 |
| Graphs that are simultaneously efficient open domination and efficient closed domination graphs S Klavžar, I Peterin, IG Yero Discrete Applied Mathematics 217, 613-621, 2017 | 22 | 2017 |
| Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle S Klavzar, I Peterin Publ. Math. Debrecen 71 (3-4), 267-278, 2007 | 22 | 2007 |
| Group distance magic labeling of direct product of graphs. M Anholcer, S Cichacz, I Peterin, A Tepeh Ars Math. Contemp. 9 (1), 93-107, 2015 | 21 | 2015 |
Ismael G. YeroUniversidad de Cádizuca.es의 이메일 확인됨
