| Rainbow domination in graphs B Brešar, MA Henning, DF Rall Taiwanese Journal of Mathematics 12 (1), 213-225, 2008 | 165 | 2008 |
| Domination game and an imagination strategy B Brešar, S Klavžar, DF Rall SIAM Journal on Discrete Mathematics 24 (3), 979-991, 2010 | 146 | 2010 |
| Vizing's conjecture: a survey and recent results B Brešar, P Dorbec, W Goddard, BL Hartnell, MA Henning, S Klavžar, ... Journal of Graph Theory 69 (1), 46-76, 2012 | 140 | 2012 |
| Minimum k-path vertex cover B Brešar, F Kardoš, J Katrenič, G Semanišin Discrete Applied Mathematics 159 (12), 1189-1195, 2011 | 134 | 2011 |
| On the 2-rainbow domination in graphs B Brešar, TK Šumenjak Discrete Applied Mathematics 155 (17), 2394-2400, 2007 | 132 | 2007 |
| On the packing chromatic number of Cartesian products, hexagonal lattice, and trees B Brešar, S Klavžar, DF Rall Discrete Applied Mathematics 155 (17), 2303-2311, 2007 | 98 | 2007 |
| On the geodetic number and related metric sets in Cartesian product graphs B Brešar, S Klavžar, AT Horvat Discrete Mathematics 308 (23), 5555-5561, 2008 | 69 | 2008 |
| Nonrepetitive colorings of trees B Brešar, J Grytczuk, S Klavžar, S Niwczyk, I Peterin Discrete Mathematics 307 (2), 163-172, 2007 | 60 | 2007 |
| Domination game played on trees and spanning subgraphs B Brešar, S Klavžar, DF Rall Discrete Mathematics 313 (8), 915-923, 2013 | 54 | 2013 |
| Hypercubes as direct products B Bresar, W Imrich, S Klavzar, B Zmazek SIAM Journal on Discrete Mathematics 18 (4), 778-786, 2005 | 53 | 2005 |
| Domination game: effect of edge-and vertex-removal B Brešar, P Dorbec, S Klavžar, G Košmrlj Discrete Mathematics 330, 1-10, 2014 | 52 | 2014 |
| Domination game: extremal families of graphs for 3/5-conjectures B Brešar, S Klavžar, G Košmrlj, DF Rall Discrete Applied Mathematics 161 (10-11), 1308-1316, 2013 | 51 | 2013 |
| 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 | 49 | 2008 |
| Grundy dominating sequences and zero forcing sets B Brešar, C Bujtás, T Gologranc, S Klavžar, G Košmrlj, B Patkós, Z Tuza, ... Discrete Optimization 26, 66-77, 2017 | 48* | 2017 |
| On the vertex k-path cover B Brešar, M Jakovac, J Katrenič, G Semanišin, A Taranenko Discrete Applied Mathematics 161 (13-14), 1943-1949, 2013 | 48 | 2013 |
| Dominating direct products of graphs B Brešar, S Klavžar, DF Rall Discrete Mathematics 307 (13), 1636-1642, 2007 | 39 | 2007 |
| On the connectivity of the direct product of graphs B Brešar, S Špacapan Australas. J. Combin 41, 45-56, 2008 | 38 | 2008 |
| Geodetic sets in graphs B Brešar, M Kovše, A Tepeh Structural Analysis of Complex Networks, 197-218, 2011 | 35 | 2011 |
| Paired-domination of Cartesian products of graphs B Bresar, MA Henning, DF Rall Utilitas Mathematica 73, 255-265, 2007 | 35 | 2007 |
| On integer domination in graphs and Vizing-like problems B Brešar, MA Henning, S Klavžar Taiwanese Journal of Mathematics, 1317-1328, 2006 | 35 | 2006 |
Sandi KlavžarProfessor of Mathematics, University of Ljubljana and University of MariborAdresse e-mail validée de fmf.uni-lj.si
