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 | 66 | 2008 |
Extremal graphs for the identifying code problem F Foucaud, E Guerrini, M Kovše, R Naserasr, A Parreau, P Valicov European Journal of Combinatorics 32 (4), 628-638, 2011 | 57 | 2011 |
Generalized sierpinski graphs S Gravier, M Kovše, A Parreau Posters at EuroComb 11, 2011 | 43 | 2011 |
Geodetic sets in graphs B Brešar, M Kovše, A Tepeh Structural Analysis of Complex Networks, 197-218, 2011 | 41 | 2011 |
New results on variants of covering codes in Sierpinski graphs S Gravier, M Kovse, M Mollard, J Moncel, A Parreau arXiv preprint arXiv:1201.1202, 2012 | 36 | 2012 |
Cover-incomparability graphs of posets B Brešar, M Changat, S Klavžar, M Kovše, J Mathews, A Mathews Order 25 (4), 335-347, 2008 | 34 | 2008 |
Computing median and antimedian sets in median graphs K Balakrishnan, B Brešar, M Changat, S Klavžar, M Kovše, ... Algorithmica 57, 207-216, 2010 | 22 | 2010 |
Covering codes in Sierpinski graphs L Beaudou, S Gravier, S Klavžar, M Kovse, M Mollard Discrete Mathematics & Theoretical Computer Science 12 (Graph and Algorithms), 2010 | 21 | 2010 |
Identifying path covers in graphs F Foucaud, M Kovše Journal of Discrete Algorithms 23, 21-34, 2013 | 19 | 2013 |
On the remoteness function in median graphs K Balakrishnan, B Brešar, M Changat, W Imrich, S Klavžar, M Kovše, ... Discrete applied mathematics 157 (18), 3679-3688, 2009 | 15 | 2009 |
Partial cubes and their τ-graphs S Klavžar, M Kovše European Journal of Combinatorics 28 (4), 1037-1042, 2007 | 15 | 2007 |
Simultaneous embeddings of graphs as median and antimedian subgraphs K Balakrishnan, B Brešar, M Kovše, M Changat, AR Subhamathi, ... Networks 56 (2), 90-94, 2010 | 13 | 2010 |
Vertex decomposition of Steiner Wiener index and Steiner betweenness centrality M Kovše arXiv preprint arXiv:1605.00260, 2016 | 11 | 2016 |
On even and harmonic-even partial cubes S Klavzar, M Kovše Ars Combin 93, 77-86, 2009 | 9 | 2009 |
On graph identification problems and the special case of identifying vertices using paths F Foucaud, M Kovše International Workshop on Combinatorial Algorithms, 32-45, 2012 | 7 | 2012 |
The lattice dimension of benzenoid systems S Klavzar, M Kovše MATCH Commun. Math. Comput. Chem 56, 637-648, 2006 | 7 | 2006 |
Complexity of phylogenetic networks: counting cubes in median graphs and related problems M Kovše Analysis of complex networks: From Biology to Linguistics, 323-350, 2009 | 6 | 2009 |
On Θ-graphs of partial cubes S Klavzar, M Kovše Discuss. Math. Graph Theory, to appear, 2007 | 6* | 2007 |
Steiner Wiener index of block graphs M Kovše, VA Rasila, A Vijayakumar AKCE International Journal of Graphs and Combinatorics, 1-8, 2020 | 5 | 2020 |
Topological representation of the transit sets of k-point crossover operators M Changat, PG Narasimha-Shenoi, FH Nezhad, M Kovše, S Mohandas, ... arXiv preprint arXiv:1712.09022, 2017 | 5 | 2017 |