On Tetha-graphs of partial cubes. - Sandi Klavzar; Matjaz Kovse (Discuss. Math. Graph Theory, 2007)

Partial cubes and their tau-graphs. - Sandi Klavzar; Matjaz Kovse (Eur. J. Comb., 2007)

Game Chromatic Number of Cartesian Product Graphs. - Tomasz Bartnicki; Bostjan Bresar; Jaroslaw Grytczuk; Matjaz Kovse; Zofia Miechowicz; Iztok Peterin (Electron. J. Comb., 2008)

Cover-Incomparability Graphs of Posets. - Bostjan Bresar; Manoj Changat; Sandi Klavzar; Matjaz Kovse; Joseph Mathews; Antony Mathews (Order, 2008)

On Even and Harmonic-Even Partial Cubes. - Sandi Klavzar; Matjaz Kovse (Ars Comb., 2009)

On the remoteness function in median graphs. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Wilfried Imrich; Sandi Klavzar; Matjaz Kovse; Ajitha R. Subhamathi (Discret. Appl. Math., 2009)

Induced cycles in crossing graphs of median graphs. - Sandi Klavzar; Matjaz Kovse (Discret. Math., 2009)

Lattice embeddings of trees. - Wilfried Imrich; Matjaz Kovse (Eur. J. Comb., 2009)

On semicube graphs. - Sandi Klavzar; Matjaz Kovse (Eur. J. Comb., 2009)

Computing median and antimedian sets in median graphs. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Sandi Klavzar; Matjaz Kovse; Ajitha R. Subhamathi (Algorithmica, 2010)

Covering codes in Sierpinski graphs. - Laurent Beaudou; Sylvain Gravier; Sandi Klavzar; Matjaz Kovse; Michel Mollard (Discret. Math. Theor. Comput. Sci., 2010)

Simultaneous embeddings of graphs as median and antimedian subgraphs. - Kannan Balakrishnan; Bostjan Bresar; Matjaz Kovse; Manoj Changat; Ajitha R. Subhamathi; Sandi Klavzar (Networks, 2010)

Geodetic Sets in Graphs. - Bostjan Bresar; Matjaz Kovse; Aleksandra Tepeh (Structural Analysis of Complex Networks, 2011)

Extremal graphs for the identifying code problem. - Florent Foucaud; Eleonora Guerrini; Matjaz Kovse; Reza Naserasr; Aline Parreau; Petru Valicov (Eur. J. Comb., 2011)

Expansion Procedures and Buneman Hypergraphs. - Matjaz Kovse (CTW, 2012)

On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. - Florent Foucaud; Matjaz Kovse (IWOCA, 2012)

New results on variants of covering codes in Sierpiński graphs. - Sylvain Gravier; Matjaz Kovse; Michel Mollard; Julien Moncel; Aline Parreau (Des. Codes Cryptogr., 2013)

Identifying path covers in graphs. - Florent Foucaud; Matjaz Kovse (J. Discrete Algorithms, 2013)

Retracts of Products of Chordal Graphs. - Bostjan Bresar; Jérémie Chalopin; Victor Chepoi; Matjaz Kovse; Arnaud Labourel; Yann Vaxès (J. Graph Theory, 2013)

Topological Representation of the Transit Sets of k-Point Crossover Operators. - Manoj Changat; Prasanth G. Narasimha-Shenoi; Ferdoos Hossein Nezhad; Matjaz Kovse; Shilpa Mohandas; Abisha Ramachandran; Peter F. Stadler (CoRR, 2017)

Transit sets of -point crossover operators. - Manoj Changat; Prasanth G. Narasimha-Shenoi; Ferdoos Hossein Nezhad; Matjaz Kovse; Shilpa Mohandas; Abisha Ramachandran; Peter F. Stadler (AKCE Int. J. Graphs Comb., 2020)

Steiner Wiener index of block graphs. - Matjaz Kovse; V. A. Rasila; Ambat Vijayakumar (AKCE Int. J. Graphs Comb., 2020)

Not all partial cubes are Θ-graceful. - Nathann Cohen; Matjaz Kovse (Discret. Math., 2020)