Intersection graphs of halflines and halfplanes. - Sandi Klavzar; Marko Petkovsek (Discret. Math., 1987)

On system diagnosis for transient fault situations. - Franc Novak; Sandi Klavzar; Ludvik Gyergyek (Microprocess. Microprogramming, 1988)

Retracts of strong products of graphs. - Wilfried Imrich; Sandi Klavzar (Discret. Math., 1992)

Two remarks on retracts of graph products. - Sandi Klavzar (Discret. Math., 1992)

Dynamic Programming and Convex Clustering. - Vladimir Batagelj; Simona Korenjak-Cerne; Sandi Klavzar (Algorithmica, 1994)

On the chromatic number of the lexicographic product and the Cartesian sum of graphs. - Niko Cizek; Sandi Klavzar (Discret. Math., 1994)

Absolute retracts of split graphs. - Sandi Klavzar (Discret. Math., 1994)

Strong products of Kneser graphs. - Sandi Klavzar; Uros Milutinovic (Discret. Math., 1994)

Dominating Cartesian Products of Cycles. - Sandi Klavzar; Norbert Seifter (Discret. Appl. Math., 1995)

The chromatic numbers of graph bundles over cycles. - Sandi Klavzar; Bojan Mohar (Discret. Math., 1995)

Recognizing halved cubes in a constant time per edge. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Eur. J. Comb., 1995)

An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons. - Ivan Gutman; Sandi Klavzar (J. Chem. Inf. Comput. Sci., 1995)

Fast computation of the Wiener index of fasciagraphs and rotagraphs. - Martin Juvan; Bojan Mohar; Ante Graovac; Sandi Klavzar; Janez Zerovnik (J. Chem. Inf. Comput. Sci., 1995)

Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations. - Sandi Klavzar; Ivan Gutman; Bojan Mohar (J. Chem. Inf. Comput. Sci., 1995)

Coloring graph bundles. - Sandi Klavzar; Bojan Mohar (J. Graph Theory, 1995)

On independence numbers of the cartesian product of graphs. - Johann Hagauer; Sandi Klavzar (Ars Comb., 1996)

Algebraic Approach to Fasciagraphs and Rotagraphs. - Sandi Klavzar; Janez Zerovnik (Discret. Appl. Math., 1996)

Clique-gated graphs. - Johann Hagauer; Sandi Klavzar (Discret. Math., 1996)

Coloring graph products - A survey. - Sandi Klavzar (Discret. Math., 1996)

On a Vizing-like conjecture for direct product graphs. - Sandi Klavzar; Blaz Zmazek (Discret. Math., 1996)

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. - Wilfried Imrich; Sandi Klavzar (Eur. J. Comb., 1996)

A Comparison of the Schultz Molecular Topological Index with the Wiener Index. - Sandi Klavzar; Ivan Gutman (J. Chem. Inf. Comput. Sci., 1996)

Distributed multicast routing in point-to-point networks. - Joze Rugelj; Sandi Klavzar (Comput. Oper. Res., 1997)

Wiener Number of Vertex-weighted Graphs and a Chemical Application. - Sandi Klavzar; Ivan Gutman (Discret. Appl. Math., 1997)

Isomorphic components of Kronecker product of bipartite graphs. - Pranava K. Jha; Sandi Klavzar; Blaz Zmazek (Discuss. Math. Graph Theory, 1997)

Recognizing Hamming Graphs in Linear Time and space. - Wilfried Imrich; Sandi Klavzar (Inf. Process. Lett., 1997)

The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time. - Victor Chepoi; Sandi Klavzar (J. Chem. Inf. Comput. Sci., 1997)

Bounds for the Schultz Molecular Topological Index of Benzenoid Systems in Terms of the Wiener Index. - Ivan Gutman; Sandi Klavzar (J. Chem. Inf. Comput. Sci., 1997)

Applications of isometric embeddings to chemical graphs. - Sandi Klavzar (Discrete Mathematical Chemistry, 1998)

A characterization of halved cubes. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Ars Comb., 1998)

Independence in Direct-Product Graphs. - Pranava K. Jha; Sandi Klavzar (Ars Comb., 1998)

Distances in benzenoid systems: Further developments. - Victor Chepoi; Sandi Klavzar (Discret. Math., 1998)

On the fractional chromatic number and the lexicographic product of graphs. - Sandi Klavzar (Discret. Math., 1998)

An Euler-type formula for median graphs. - Sandi Klavzar; Henry Martyn Mulder; Riste Skrekovski (Discret. Math., 1998)

A Convexity Lemma and Expansion Procedures for Bipartite Graphs. - Wilfried Imrich; Sandi Klavzar (Eur. J. Comb., 1998)

On Analog Signature Analysis. - Franc Novak; Bojan Hvala; Sandi Klavzar (DATE, 1999)

Recognizing Graphs of Acyclic Cubical Complexes. - Wilfried Imrich; Sandi Klavzar (Discret. Appl. Math., 1999)

On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract). - Sandi Klavzar; Uros Milutinovic; Ciril Petr (Electron. Notes Discret. Math., 1999)

Graphs which Locally Mirror the Hypercube Structure. - Sandi Klavzar; Jack H. Koolen; Henry Martyn Mulder (Inf. Process. Lett., 1999)

Median Graphs and Triangle-Free Graphs. - Wilfried Imrich; Sandi Klavzar; Henry Martyn Mulder (SIAM J. Discret. Math., 1999)

Recognizing Median Graphs in Subquadratic Time. - Johann Hagauer; Wilfried Imrich; Sandi Klavzar (Theor. Comput. Sci., 1999)

An Algorithm for the Calculation of the Hyper-Wiener Index of Benzenoid Hydrocarbons. - Sandi Klavzar; Petra Zigert; Ivan Gutman (Comput. Chem., 2000)

On median graphs and median grid graphs. - Sandi Klavzar; Riste Skrekovski (Discret. Math., 2000)

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem. - Sandi Klavzar; Uros Milutinovic; Ciril Petr (Ars Comb., 2001)

Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. - Sandi Klavzar; Aleksander Vesel; Petra Zigert; Ivan Gutman (Comput. Chem., 2001)

Cubes polynomial and its derivatives. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Electron. Notes Discret. Math., 2001)

A min-max result on catacondensed benzenoid graphs. - Sandi Klavzar; Petra Zigert (Appl. Math. Lett., 2002)

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. - Sandi Klavzar; Uros Milutinovic; Ciril Petr (Discret. Appl. Math., 2002)

On the fractional chromatic number, the chromatic number, and graph products. - Sandi Klavzar; Hong-Gwa Yeh (Discret. Math., 2002)

On subgraphs of Cartesian product graphs. - Sandi Klavzar; Alenka Lipovec; Marko Petkovsek (Discret. Math., 2002)

Preface. - Sandi Klavzar; Dragan Marusic; Bojan Mohar (Discret. Math., 2002)

Resonance graphs of catacondensed even ring systems are median. - Sandi Klavzar; Petra Zigert; Gunnar Brinkmann (Discret. Math., 2002)

Three Methods for Calculation of the Hyper-Wiener Index of Molecular Graphs. - Gordon G. Cash; Sandi Klavzar; Marko Petkovsek (J. Chem. Inf. Comput. Sci., 2002)

Tiled partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Henry Martyn Mulder; Riste Skrekovski (J. Graph Theory, 2002)

Partial Cubes and Crossing Graphs. - Sandi Klavzar; Henry Martyn Mulder (SIAM J. Discret. Math., 2002)

On cubic and edge-critical isometric subgraphs of hypercubes. - C. Paul Bonnington; Sandi Klavzar; Alenka Lipovec (Australas. J Comb., 2003)

The Cube Polynomial and its Derivatives: the Case of Median Graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Electron. J. Comb., 2003)

Fast recognition algorithms for classes of partial cubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Appl. Math., 2003)

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. - Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2003)

Isometric embeddings of subdivided wheels in hypercubes. - Sylvain Gravier; Sandi Klavzar; Michel Mollard (Discret. Math., 2003)

Partial cubes as subdivision graphs and as generalized Petersen graphs. - Sandi Klavzar; Alenka Lipovec (Discret. Math., 2003)

Tree-like isometric subgraphs of hypercubes. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discuss. Math. Graph Theory, 2003)

Preface. - Sandi Klavzar; Bojan Mohar; Tomaz Pisanski; Norbert Seifter; Janez Zerovnik (Discuss. Math. Graph Theory, 2003)

Quasi-median graphs, their generalizations, and tree-like equalities. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Eur. J. Comb., 2003)

Square-free colorings of graphs. - Bostjan Bresar; Sandi Klavzar (Ars Comb., 2004)

Edge-critical isometric subgraphs of hypercubes. - Sandi Klavzar; Alenka Lipovec (Ars Comb., 2004)

Cubic inflation, mirror graphs, regular maps, and partial cubes. - Bostjan Bresar; Sandi Klavzar; Alenka Lipovec; Bojan Mohar (Eur. J. Comb., 2004)

Some new bounds and exact results on the independence number of Cartesian product graphs. - Sandi Klavzar (Ars Comb., 2005)

L(2, 1)-labeling of direct product of paths and cycles. - Pranava K. Jha; Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2005)

Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. - Pranava K. Jha; Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2005)

Reconstructing subgraph-counting graph polynomials of increasing families of graphs. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar (Discret. Math., 2005)

On median nature and enumerative properties of Fibonacci-like cubes. - Sandi Klavzar (Discret. Math., 2005)

Median and quasi-median direct products of graphs. - Bostjan Bresar; Pranava K. Jha; Sandi Klavzar; Blaz Zmazek (Discuss. Math. Graph Theory, 2005)

Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence. - Andreas M. Hinz; Sandi Klavzar; Uros Milutinovic; Daniele Parisse; Ciril Petr (Eur. J. Comb., 2005)

Characterizing r-perfect codes in direct products of two and three cycles. - Janja Jerebic; Sandi Klavzar; Simon Spacapan (Inf. Process. Lett., 2005)

Crossing numbers of Sierpinski-like graphs. - Sandi Klavzar; Bojan Mohar (J. Graph Theory, 2005)

Characterizing subgraphs of Hamming graphs. - Sandi Klavzar; Iztok Peterin (J. Graph Theory, 2005)

Hypercubes As Direct Products. - Bostjan Bresar; Wilfried Imrich; Sandi Klavzar; Blaz Zmazek (SIAM J. Discret. Math., 2005)

An almost complete description of perfect codes in direct products of cycles. - Sandi Klavzar; Simon Spacapan; Janez Zerovnik (Adv. Appl. Math., 2006)

A theorem on Wiener-type invariants for isometric subgraphs of hypercubes. - Sandi Klavzar; Ivan Gutman (Appl. Math. Lett., 2006)

Theta-graceful labelings of partial cubes. - Bostjan Bresar; Sandi Klavzar (Discret. Math., 2006)

On induced and isometric embeddings of graphs into the strong product of paths. - Janja Jerebic; Sandi Klavzar (Discret. Math., 2006)

Counting hypercubes in hypercubes. - Sandi Klavzar (Discret. Math., 2006)

On the role of hypercubes in the resonance graphs of benzenoid graphs. - Khaled Salem; Sandi Klavzar; Ivan Gutman (Discret. Math., 2006)

Some results on total domination in direct products of graphs. - Paul Dorbec; Sylvain Gravier; Sandi Klavzar; Simon Spacapan (Discuss. Math. Graph Theory, 2006)

On the canonical metric representation, average distance, and partial Hamming graphs. - Sandi Klavzar (Eur. J. Comb., 2006)

Roots of cube polynomials of median graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (J. Graph Theory, 2006)

Distinguishing Cartesian powers of graphs. - Wilfried Imrich; Sandi Klavzar (J. Graph Theory, 2006)

The Δ2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs. - Sandi Klavzar; Simon Spacapan (IEEE Trans. Circuits Syst. II Express Briefs, 2006)

Stern polynomials. - Sandi Klavzar; Uros Milutinovic; Ciril Petr (Adv. Appl. Math., 2007)

On plane bipartite graphs without fixed edges. - Khaled Salem; Sandi Klavzar (Appl. Math. Lett., 2007)

Distinguishing Infinite Graphs. - Wilfried Imrich; Sandi Klavzar; Vladimir Ivanovich Trofimov (Electron. J. Comb., 2007)

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. - Dalibor Froncek; Janja Jerebic; Sandi Klavzar; Petr Kovár (Comb. Probab. Comput., 2007)

On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

Cancellation properties of products of graphs. - Wilfried Imrich; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2007)

Nonrepetitive colorings of trees. - Bostjan Bresar; Jaroslaw Grytczuk; Sandi Klavzar; Staszek Niwczyk; Iztok Peterin (Discret. Math., 2007)

Maximal proper subgraphs of median graphs. - Bostjan Bresar; Sandi Klavzar (Discret. Math., 2007)

Dominating direct products of graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2007)

On cube-free median graphs. - Bostjan Bresar; Sandi Klavzar; Riste Skrekovski (Discret. Math., 2007)

Preface. - Sandi Klavzar; Dragan Marusic; Bojan Mohar; Tomaz Pisanski (Discret. Math., 2007)

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

Tribes of Cubic Partial Cubes. - Sandi Klavzar; Sergey V. Shpectorov (Discret. Math. Theor. Comput. Sci., 2007)

Hamming polynomials and their partial derivatives. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Michel Mollard (Eur. J. Comb., 2007)

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

Cartesian powers of graphs can be distinguished by two labels. - Sandi Klavzar; Xuding Zhu (Eur. J. Comb., 2007)

Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. - Bostjan Bresar; Sandi Klavzar (SIAM J. Discret. Math., 2007)

Antimedian graphs. - Kannan Balakrishnan; Manoj Changat; Sandi Klavzar; Joseph Mathews; Iztok Peterin; G. N. Prasanth; Simon Spacapan (Australas. J Comb., 2008)

The median function on graphs with bounded profiles. - Kannan Balakrishnan; Manoj Changat; Sandi Klavzar (Discret. Appl. Math., 2008)

On the geodetic number and related metric sets in Cartesian product graphs. - Bostjan Bresar; Sandi Klavzar; Aleksandra Tepeh Horvat (Discret. Math., 2008)

The distinguishing number of Cartesian products of complete graphs. - Wilfried Imrich; Janja Jerebic; Sandi Klavzar (Eur. J. Comb., 2008)

On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. - Douglas F. Rall; Bostjan Bresar; Art S. Finbow; Sandi Klavzar (Electron. Notes Discret. Math., 2008)

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

Power Domination in Product Graphs. - Paul Dorbec; Michel Mollard; Sandi Klavzar; Simon Spacapan (SIAM J. Discret. Math., 2008)

Improved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs. - Zhendong Shao; Sandi Klavzar; Wai Chee Shiu; David Zhang 001 (IEEE Trans. Circuits Syst. II Express Briefs, 2008)

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

Characterizing posets for which their natural transit functions coincide. - Bostjan Bresar; Manoj Changat; Sandi Klavzar; Joseph Mathews; Antony Mathews; Prasanth G. Narasimha-Shenoi (Ars Math. Contemp., 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)

The Clar formulas of a benzenoid system and the resonance graph. - Khaled Salem; Sandi Klavzar; Aleksander Vesel; Petra Zigert (Discret. Appl. Math., 2009)

Vertex-, edge-, and total-colorings of Sierpinski-like graphs. - Marko Jakovac; Sandi Klavzar (Discret. Math., 2009)

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

The packing chromatic number of infinite product graphs. - Jirí Fiala 001; Sandi Klavzar; Bernard Lidický (Eur. J. Comb., 2009)

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

Preface. - Sandi Klavzar; Sergey V. Shpectorov (Eur. J. Comb., 2009)

Transitive, Locally Finite Median Graphs with Finite Blocks. - Wilfried Imrich; Sandi Klavzar (Graphs 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)

Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems. - Sandi Klavzar; Khaled Salem; Andrej Taranenko (Comput. Math. Appl., 2010)

The distinguishing chromatic number of Cartesian products of two complete graphs. - Janja Jerebic; Sandi Klavzar (Discret. Math., 2010)

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

On distance-balanced graphs. - Aleksandar Ilic; Sandi Klavzar; Marjan Milanovic (Eur. J. Comb., 2010)

The b-Chromatic Number of Cubic Graphs. - Marko Jakovac; Sandi Klavzar (Graphs Comb., 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)

Domination Game and an Imagination Strategy. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (SIAM J. Discret. Math., 2010)

Computing quadratic entropy in evolutionary trees. - Drago Bokal; Matt DeVos; Sandi Klavzar; Aki Mimoto; Arne Ø. Mooers (Comput. Math. Appl., 2011)

On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes. - Aline Castro; Sandi Klavzar; Michel Mollard; Yoomi Rho (Comput. Math. Appl., 2011)

The Fibonacci Dimension of a Graph. - Sergio Cabello; David Eppstein; Sandi Klavzar (Electron. J. Comb., 2011)

Two-ended regular median graphs. - Wilfried Imrich; Sandi Klavzar (Discret. Math., 2011)

The degree sequence of Fibonacci and Lucas cubes. - Sandi Klavzar; Michel Mollard; Marko Petkovsek (Discret. Math., 2011)

On Idomatic Partitions of Direct Products of Complete Graphs. - Sandi Klavzar; Gasper Mekis (Graphs Comb., 2011)

Parity Index of Binary Words and Powers of Prime Words. - Aleksandar Ilic; Sandi Klavzar; Yoomi Rho (Electron. J. Comb., 2012)

A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs. - Sandi Klavzar; Khaled Salem (Discret. Appl. Math., 2012)

Preface. - R. Balakrishnan; R. B. Bapat 001; Sandi Klavzar; Ambat Vijayakumar; Thomas Zaslavsky; Xuding Zhu (Discret. Math., 2012)

Generalized Fibonacci cubes. - Aleksandar Ilic; Sandi Klavzar; Yoomi Rho (Discret. Math., 2012)

Characterizing almost-median graphs II. - Sandi Klavzar; Sergey V. Shpectorov (Discret. Math., 2012)

On the rainbow connection of Cartesian products and their subgraphs. - Sandi Klavzar; Gasper Mekis (Discuss. Math. Graph Theory, 2012)

Asymptotic number of isometric generalized Fibonacci cubes. - Sandi Klavzar; Sergey V. Shpectorov (Eur. J. Comb., 2012)

Convex Sets in Lexicographic Products of Graphs. - Bijo S. Anand; Manoj Changat; Sandi Klavzar; Iztok Peterin (Graphs Comb., 2012)

Vizing's conjecture: a survey and recent results. - Bostjan Bresar; Paul Dorbec; Wayne Goddard; Bert L. Hartnell; Michael A. Henning; Sandi Klavzar; Douglas F. Rall (J. Graph Theory, 2012)

Convex excess in partial cubes. - Sandi Klavzar; Sergey V. Shpectorov (J. Graph Theory, 2012)

The index of a binary word. - Aleksandar Ilic; Sandi Klavzar; Yoomi Rho (Theor. Comput. Sci., 2012)

The Tower of Hanoi - Myths and Maths. - Andreas M. Hinz; Sandi Klavzar; Uros Milutinovic; Ciril Petr (Birkhäuser, 2013)

Domination game: Extremal families of graphs for 3/53/5-conjectures. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Appl. Math., 2013)

Wiener index versus Szeged index in networks. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Appl. Math., 2013)

Domination game played on trees and spanning subgraphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2013)

Hamming dimension of a graph - The case of Sierpiński graphs. - Sandi Klavzar; Iztok Peterin; Sara Sabrina Zemljic (Eur. J. Comb., 2013)

Structure of Fibonacci cubes: a survey. - Sandi Klavzar (J. Comb. Optim., 2013)

Computing distance moments on graphs with transitive Djoković-Winkler relation. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Appl. Math., 2014)

Equal opportunity networks, distance-balanced graphs, and Wiener game. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Sandi Klavzar; Aleksander Vesel; Petra Zigert Pletersek (Discret. Optim., 2014)

Domination game: Effect of edge- and vertex-removal. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj (Discret. Math., 2014)

On the difference between the revised Szeged index and the Wiener index. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Math., 2014)

Fibonacci (p, r)-cubes as Cartesian products. - Sandi Klavzar; Yoomi Rho (Discret. Math., 2014)

Wiener index in weighted graphs via unification of Θ∗Θ∗-classes. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Eur. J. Comb., 2014)

Improved bounds on the difference between the Szeged index and the Wiener index of graphs. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Eur. J. Comb., 2014)

Cut method and Djoković-Winkler's relation. - Mohammad J. Nadjafi-Arani; Sandi Klavzar (Electron. Notes Discret. Math., 2014)

The domination number of exchanged hypercubes. - Sandi Klavzar; Meijie Ma (Inf. Process. Lett., 2014)

Average distance, surface area, and other structural properties of exchanged hypercubes. - Sandi Klavzar; Meijie Ma (J. Supercomput., 2014)

On the Wiener index of generalized Fibonacci cubes and Lucas cubes. - Sandi Klavzar; Yoomi Rho (Discret. Appl. Math., 2015)

Weighted Harary indices of apex trees and k-apex trees. - Kexiang Xu; Jinlan Wang; Kinkar Chandra Das; Sandi Klavzar (Discret. Appl. Math., 2015)

Domination game critical graphs. - Csilla Bujtás; Sandi Klavzar; Gasper Kosmrlj (Discuss. Math. Graph Theory, 2015)

Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes. - Jernej Azarija; Sandi Klavzar; Jaehun Lee; Yoomi Rho (Discret. Math. Theor. Comput. Sci., 2015)

Guarded subgraphs and the domination game. - Bostjan Bresar; Sandi Klavzar; Gasper Kosmrlj; Douglas F. Rall (Discret. Math. Theor. Comput. Sci., 2015)

Total Version of the Domination Game. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2015)

Local colourings of Cartesian product graphs. - Sandi Klavzar; Zehui Shao (Int. J. Comput. Math., 2015)

Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles. - Jernej Azarija; Sandi Klavzar (J. Graph Theory, 2015)

Modified Wiener index via canonical metric representation, and some fullerene patches. - Modjtaba Ghorbani; Sandi Klavzar (Ars Math. Contemp., 2016)

Wilfried Imrich's 75th Birthday Colloquium. - Sandi Klavzar (Ars Math. Contemp., 2016)

Bojan Mohar's 60th Birthday. - Sandi Klavzar (Ars Math. Contemp., 2016)

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. - Sandi Klavzar; Paul D. Manuel; Mohammad J. Nadjafi-Arani; R. Sundara Rajan; Cyriac Grigorious; Sudeep Stephen (Comput. J., 2016)

Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. - Zhendong Shao; Igor Averbakh; Sandi Klavzar (Comput. J., 2016)

Dominating Sequences in Grid-Like and Toroidal Graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Electron. J. Comb., 2016)

Edge-transitive lexicographic and Cartesian products. - Wilfried Imrich; Ali Iranmanesh; Sandi Klavzar; Abolghasem Soltani (Discuss. Math. Graph Theory, 2016)

On isomorphism classes of generalized Fibonacci cubes. - Jernej Azarija; Sandi Klavzar; Jaehun Lee; Jay Pantone; Yoomi Rho (Eur. J. Comb., 2016)

Packing Chromatic Number of Base-3 Sierpiński Graphs. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2016)

Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five. - Csilla Bujtás; Sandi Klavzar (Graphs Comb., 2016)

The (non-)existence of perfect codes in Fibonacci cubes. - Ali Reza Ashrafi; Jernej Azarija; Azam Babai; Khadijeh Fathalikhani; Sandi Klavzar (Inf. Process. Lett., 2016)

Complexity of the game domination problem. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj; Gabriel Renault (Theor. Comput. Sci., 2016)

The 4/5 upper bound on the game total domination number. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Comb., 2017)

(Total) Domination in Prisms. - Jernej Azarija; Michael A. Henning; Sandi Klavzar (Electron. J. Comb., 2017)

A survey and classification of Sierpiński-type graphs. - Andreas M. Hinz; Sandi Klavzar; Sara Sabrina Zemljic (Discret. Appl. Math., 2017)

Graphs that are simultaneously efficient open domination and efficient closed domination graphs. - Sandi Klavzar; Iztok Peterin; Ismael González Yero (Discret. Appl. Math., 2017)

On the signed Roman k-domination: Complexity and thin torus graphs. - Zehui Shao; Sandi Klavzar; Zepeng Li; Pu Wu; Jin Xu 002 (Discret. Appl. Math., 2017)

Grundy dominating sequences and zero forcing sets. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discret. Optim., 2017)

Packing chromatic number under local changes in a graph. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall; Kirsti Wash (Discret. Math., 2017)

How long can one bluff in the domination game?. - Bostjan Bresar; Paul Dorbec; Sandi Klavzar; Gasper Kosmrlj (Discuss. Math. Graph Theory, 2017)

On the Structure of Dominating Graphs. - Saeid Alikhani; Davood Fatehi; Sandi Klavzar (Graphs Comb., 2017)

Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. - Bostjan Bresar; Sandi Klavzar (Art Discret. Appl. Math., 2018)

On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs. - Yaser Alizadeh; Sandi Klavzar (Appl. Math. Comput., 2018)

General Transmission Lemma and Wiener complexity of triangular grids. - Sandi Klavzar; D. Azubha Jemilet; Indra Rajasingh; Paul D. Manuel; N. Parthiban (Appl. Math. Comput., 2018)

On domination-type invariants of Fibonacci cubes and hypercubes. - Jernej Azarija; Sandi Klavzar; Yoomi Rho; Seungbo Sim (Ars Math. Contemp., 2018)

Game total domination critical graphs. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2018)

On the difference between the (revised) Szeged index and the Wiener index of cacti. - Sandi Klavzar; Shuchao Li; Huihui Zhang 002 (Discret. Appl. Math., 2018)

On graphs with largest possible game domination number. - Kexiang Xu; Xia Li; Sandi Klavzar (Discret. Math., 2018)

The Graph Theory General Position Problem on Some Interconnection Networks. - Paul D. Manuel; Sandi Klavzar (Fundam. Informaticae, 2018)

Embeddings into almost self-centered graphs of given radius. - Kexiang Xu; Haiqiong Liu; Kinkar Chandra Das; Sandi Klavzar (J. Comb. Optim., 2018)

Strong geodetic problem on Cartesian products of graphs. - Vesna Irsic; Sandi Klavzar (RAIRO Oper. Res., 2018)

Characterization of general position sets and its applications to cographs and bipartite graphs. - Bijo S. Anand; S. V. Ullas Chandran; Manoj Changat; Sandi Klavzar; Elias John Thomas (Appl. Math. Comput., 2019)

Strong geodetic cores and Cartesian product graphs. - Valentin Gledel; Vesna Irsic; Sandi Klavzar (Appl. Math. Comput., 2019)

Distribution of global defensive k-alliances over some graph products. - Mostafa Tavakoli; Sandi Klavzar (Central Eur. J. Oper. Res., 2019)

On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs. - Sandi Klavzar; Kolja Knauer; Tilen Marc (CoRR, 2019)

Metric properties of generalized Sierpiński graphs over stars. - Yaser Alizadeh; Ehsan Estaji; Sandi Klavzar; Marko Petkovsek (Discret. Appl. Math., 2019)

Cutting lemma and union lemma for the domination game. - Paul Dorbec; Michael A. Henning; Sandi Klavzar; Gasper Kosmrlj (Discret. Math., 2019)

Domination game and minimal edge cuts. - Sandi Klavzar; Douglas F. Rall (Discret. Math., 2019)

A note on the Frame-Stewart conjecture. - Thierry Bousch; Andreas M. Hinz; Sandi Klavzar; Daniele Parisse; Ciril Petr; Paul K. Stockmeyer (Discret. Math. Algorithms Appl., 2019)

Packing chromatic vertex-critical graphs. - Sandi Klavzar; Douglas F. Rall (Discret. Math. Theor. Comput. Sci., 2019)

Daisy cubes and distance cube polynomial. - Sandi Klavzar; Michel Mollard (Eur. J. Comb., 2019)

Fast Winning Strategies for the Maker-Breaker Domination Game. - Valentin Gledel; Vesna Irsic; Sandi Klavzar (LAGOS, 2019)

Exact Distance Graphs of Product Graphs. - Bostjan Bresar; Nicolas Gastineau; Sandi Klavzar; Olivier Togni (Graphs Comb., 2019)

M-polynomial revisited: Bethe cacti and an extension of Gutman's approach. - Emeric Deutsch; Sandi Klavzar (J. Appl. Math. Comput., 2019)

A lower bound and several exact results on the d-lucky number. - Sandi Klavzar; Indra Rajasingh; D. Ahima Emilet (Appl. Math. Comput., 2020)

Local metric dimension of graphs: Generalized hierarchical products and some applications. - Sandi Klavzar; Mostafa Tavakoli (Appl. Math. Comput., 2020)

Maker-Breaker total domination game. - Valentin Gledel; Michael A. Henning; Vesna Irsic; Sandi Klavzar (Discret. Appl. Math., 2020)

S-packing chromatic vertex-critical graphs. - Premysl Holub; Marko Jakovac; Sandi Klavzar (Discret. Appl. Math., 2020)

Critical graphs for the chromatic edge-stability number. - Bostjan Bresar; Sandi Klavzar; Nazanin Movarraei (Discret. Math., 2020)

Z-domination game. - Csilla Bujtás; Vesna Irsic; Sandi Klavzar (Discret. Math., 2020)

The annihilation number does not bound the 2-domination number from the above. - Jun Yue; Shizhen Zhang; Yiping Zhu; Sandi Klavzar; Yongtang Shi (Discret. Math., 2020)

Trees with distinguishing index equal distinguishing number plus one. - Saeid Alikhani; Sandi Klavzar; Florian Lehner; Samaneh Soltani (Discuss. Math. Graph Theory, 2020)

Strong geodetic problems in networks. - Andrew Arokiaraj; Sandi Klavzar; Paul D. Manuel; Elizabeth Thomas; Antony Xavier (Discuss. Math. Graph Theory, 2020)

A survey on packing colorings. - Bostjan Bresar; Jasmina Ferme; Sandi Klavzar; Douglas F. Rall (Discuss. Math. Graph Theory, 2020)

Nordhaus-Gaddum and other bounds for the chromatic edge-stability number. - Saieed Akbari; Sandi Klavzar; Nazanin Movarraei; Mina Nahvi (Eur. J. Comb., 2020)

The general position number of integer lattices. - Sandi Klavzar; Gregor Rus (Appl. Math. Comput., 2021)

Some binary products and integer linear programming for k-metric dimension of graphs. - Sandi Klavzar; Freydoon Rahbarnia; Mostafa Tavakoli (Appl. Math. Comput., 2021)

Dominated and dominator colorings over (edge) corona and hierarchical products. - Sandi Klavzar; Mostafa Tavakoli (Appl. Math. Comput., 2021)

Transmission in H-naphtalenic nanosheet. - Jane Olive Sharon; T. M. Rajalaxmi; Sandi Klavzar; R. Sundara Rajan; Indra Rajasingh (Appl. Math. Comput., 2021)

General d-position sets. - Sandi Klavzar; Douglas F. Rall; Ismael G. Yero (Ars Math. Contemp., 2021)

A Steiner general position problem in graph theory. - Sandi Klavzar; Dorota Kuziak; Iztok Peterin; Ismael G. Yero (Comput. Appl. Math., 2021)

On the computational complexity of the Steiner k-eccentricity. - Xingfu Li; Guihai Yu; Aleksandar Ilic; Sandi Klavzar (CoRR, 2021)

On the average Steiner 3-eccentricity of trees. - Xingfu Li; Guihai Yu; Sandi Klavzar (Discret. Appl. Math., 2021)

Comparing Wiener complexity with eccentric complexity. - Kexiang Xu; Aleksandar Ilic; Vesna Irsic; Sandi Klavzar; Huimin Li (Discret. Appl. Math., 2021)

Constructing new families of transmission irregular graphs. - Kexiang Xu; Sandi Klavzar (Discret. Appl. Math., 2021)

On Grundy total domination number in product graphs. - Bostjan Bresar; Csilla Bujtás; Tanja Gologranc; Sandi Klavzar; Gasper Kosmrlj; Tilen Marc; Balázs Patkós; Zsolt Tuza; Máté Vizer (Discuss. Math. Graph Theory, 2021)

The general position problem on Kneser graphs and on some graph operations. - Modjtaba Ghorbani; Sandi Klavzar; Hamid Reza Maimani; Mostafa Momeni; Farhad Rahimi Mahid; Gregor Rus (Discuss. Math. Graph Theory, 2021)

On the General Position Number of Complementary Prisms. - P. K. Neethu; S. V. Ullas Chandran; Manoj Changat; Sandi Klavzar (Fundam. Informaticae, 2021)

On ℓ-Distance-Balanced Product Graphs. - Janja Jerebic; Sandi Klavzar; Gregor Rus (Graphs Comb., 2021)

Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee. - Anja Kisek; Sandi Klavzar (Inf. Process. Lett., 2021)

On the relation between Wiener index and eccentricity of a graph. - Hamid Darabi; Yaser Alizadeh; Sandi Klavzar; Kinkar Chandra Das (J. Comb. Optim., 2021)

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength. - A. Arul Shantrinal; Sandi Klavzar; T. M. Rajalaxmi; R. Sundara Rajan (J. Graph Algorithms Appl., 2021)

Edge metric dimensions via hierarchical product and integer linear programming. - Sandi Klavzar; Mostafa Tavakoli (Optim. Lett., 2021)

The Steiner k-eccentricity on trees. - Xingfu Li; Guihai Yu; Sandi Klavzar; Jie Hu; Bo Li (Theor. Comput. Sci., 2021)

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. - R. Sundara Rajan; Thomas Kalinowski; Sandi Klavzar; Hamid Mokhtar; T. M. Rajalaxmi (J. Supercomput., 2021)

The geodesic-transversal problem. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Appl. Math. Comput., 2022)

Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks. - Savari Prabhu; V. Manimozhi; M. Arulperumjothi; Sandi Klavzar (Appl. Math. Comput., 2022)

The geodesic cover problem for butterfly networks. - Paul D. Manuel; Sandi Klavzar; R. Prabha; Andrew Arokiaraj (CoRR, 2022)

The general position achievement game played on graphs. - Sandi Klavzar; P. K. Neethu; S. V. Ullas Chandran (Discret. Appl. Math., 2022)

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs. - Hongbo Hua; Xinying Hua; Sandi Klavzar; Kexiang Xu (Discret. Math., 2022)

On the chromatic vertex stability number of graphs. - Saieed Akbari; Arash Beikmohammadi; Sandi Klavzar; Nazanin Movarraei (Eur. J. Comb., 2022)

1/2-conjectures on the domination game and claw-free graphs. - Csilla Bujtás; Vesna Irsic; Sandi Klavzar (Eur. J. Comb., 2022)

Predominating a Vertex in the Connected Domination Game. - Csilla Bujtás; Vesna Irsic; Sandi Klavzar (Graphs Comb., 2022)

Fibonacci Cubes with Applications and Variations - Ömer Egecioglu; Sandi Klavzar; Michel Mollard (WorldScientific, 2023)

On the mutual visibility in Cartesian products and triangle-free graphs. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar (Appl. Math. Comput., 2023)

Leap eccentric connectivity index in graphs with universal vertices. - Ali Ghalavand; Sandi Klavzar; Mostafa Tavakoli; Mardjan Hakimi-Nezhaad; Freydoon Rahbarnia (Appl. Math. Comput., 2023)

Graphs whose mixed metric dimension is equal to their order. - Ali Ghalavand; Sandi Klavzar; Mostafa Tavakoli (Comput. Appl. Math., 2023)

Orientable domination in product-like graphs. - Sarah E. Anderson; Bostjan Bresar; Sandi Klavzar; Kirsti Kuenzel; Douglas F. Rall (Discret. Appl. Math., 2023)

Maker-Breaker domination game on trees when Staller wins. - Csilla Bujtás; Pakanun Dokyeesun; Sandi Klavzar (Discret. Math. Theor. Comput. Sci., 2023)

The geodesic transversal problem on some networks. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Comput. Appl. Math., 2023)

Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension. - M. Arulperumjothi; Sandi Klavzar; Savari Prabhu (Appl. Math. Comput., 2023)

Variety of mutual-visibility problems in graphs. - Serafino Cicerone; Gabriele Di Stefano; Lara Drozdek; Jaka Hedzet; Sandi Klavzar; Ismael G. Yero (Theor. Comput. Sci., 2023)

A characterization of 4-χS-vertex-critical graphs for packing sequences with s1=1 and s2≥3. - Sandi Klavzar; Hui Lei 002; Xiaopan Lian; Yongtang Shi (Discret. Appl. Math., 2023)

Computational complexity aspects of super domination. - Csilla Bujtás; Nima Ghanbari; Sandi Klavzar (Theor. Comput. Sci., 2023)

Geodesic packing in graphs. - Paul D. Manuel; Bostjan Bresar; Sandi Klavzar (Appl. Math. Comput., 2023)

New transmission irregular chemical graphs. - Kexiang Xu; Jing Tian; Sandi Klavzar (Discret. Appl. Math., 2023)

Metric Dimension of Irregular Convex Triangular Networks. - Savari Prabhu; D. Sagaya Rani Jeba; M. Arulperumjothi; Sandi Klavzar (AKCE Int. J. Graphs Comb., 2024)

The Sierpiński domination number. - Michael A. Henning; Sandi Klavzar; Elzbieta Kleszcz; Monika Pilsniak (Ars Math. Contemp., 2024)

Mutual-visibility in strong products of graphs via total mutual-visibility. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (Discret. Appl. Math., 2024)

Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products. - Jing Tian; Sandi Klavzar (Discuss. Math. Graph Theory, 2024)

Mutual-visibility problems on graphs of diameter two. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (Eur. J. Comb., 2024)

The general position avoidance game and hardness of general position games. - S. V. Ullas Chandran; Sandi Klavzar; P. K. Neethu; Rudini Menezes Sampaio (Theor. Comput. Sci., 2024)

Partial domination in supercubic graphs. - Csilla Bujtás; Michael A. Henning; Sandi Klavzar (Discret. Math., 2024)

Packings in bipartite prisms and hypercubes. - Bostjan Bresar; Sandi Klavzar; Douglas F. Rall (Discret. Math., 2024)

Extremal Edge General Position Sets in Some Graphs. - Jing Tian; Sandi Klavzar; Elif Tan (Graphs Comb., 2024)

Generalization of edge general position problem. - Paul D. Manuel; R. Prabha; Sandi Klavzar (Art Discret. Appl. Math., 2025)

Metric dimensions of generalized Sierpiński graphs over squares. - Savari Prabhu; T. Jenifer Janany; Sandi Klavzar (Appl. Math. Comput., 2025)

Mutual-visibility and general position in double graphs and in Mycielskians. - Dhanya Roy; Sandi Klavzar; S. Aparna Lakshmanan (Appl. Math. Comput., 2025)

Maker-Breaker domination game critical graphs. - Athira Divakaran; Tanja Dravec; Tijo James; Sandi Klavzar; Latha S. Nair (Discret. Appl. Math., 2025)

Weighted Padovan graphs. - Vesna Irsic Chenoweth; Sandi Klavzar; Gregor Rus; Elif Tan (Discret. Math., 2025)

On {1,2}-distance-balancedness of generalized Petersen graphs. - Gang Ma 005; Jianfeng Wang; Sandi Klavzar (Discret. Math., 2025)

On independent coalition in graphs and independent coalition graphs. - Saeid Alikhani; Davood Bakhshesh; Hamid R. Golmohammadi; Sandi Klavzar (Discuss. Math. Graph Theory, 2025)

Lower general position sets in graphs. - Gabriele Di Stefano; Sandi Klavzar; Aditi Krishnakumar; James Tuite; Ismael G. Yero (Discuss. Math. Graph Theory, 2025)

Total $k$-coalition: bounds, exact values and an application to double coalition. - Bostjan Bresar; Sandi Klavzar; Babak Samadi (Discret. Math. Theor. Comput. Sci., 2025)

On the Δ-edge stability number of graphs. - Saieed Akbari; Reza Hosseini Dolatabadi; Mohsen Jamaali; Sandi Klavzar; Nazanin Movarraei (Eur. J. Comb., 2025)

Burning some myths on privacy properties of social networks against active attacks. - Serafino Cicerone; Gabriele Di Stefano; Sandi Klavzar; Ismael G. Yero (CoRR, 2025)

Injective Colorings of Sierpiński-like Graphs and Kneser Graphs. - Bostjan Bresar; Sandi Klavzar; Babak Samadi; Ismael G. Yero (Graphs Comb., 2025)

Enumerating the number of k-matchings in successively amalgamated graphs. - Simon Grad; Sandi Klavzar (Appl. Math. Comput., 2026)