List Total Colourings of Graphs. - Martin Juvan; Bojan Mohar; Riste Skrekovski (Comb. Probab. Comput., 1998)

On list edge-colorings of subcubic graphs. - Martin Juvan; Bojan Mohar; Riste Skrekovski (Discret. Math., 1998)

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

Choosability of K5-minor-free graphs. - Riste Skrekovski (Discret. Math., 1998)

The Grötzsch Theorem for the Hypergraph of Maximal Cliques. - Bojan Mohar; Riste Skrekovski (Electron. J. Comb., 1999)

A Grötzsch-Type Theorem For List Colourings With Impropriety One. - Riste Skrekovski (Comb. Probab. Comput., 1999)

Graphs of degree 4 are 5-edge-choosable. - Martin Juvan; Bojan Mohar; Riste Skrekovski (J. Graph Theory, 1999)

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

List improper colorings of planar graphs with prescribed girth. - Riste Skrekovski (Discret. Math., 2000)

A note on choosability with separation for planar graphs. - Riste Skrekovski (Ars Comb., 2001)

Nowhere-zero k-flows of Supergraphs. - Bojan Mohar; Riste Skrekovski (Electron. J. Comb., 2001)

Two relations for median graphs. - Riste Skrekovski (Discret. Math., 2001)

Gallai's innequality for critical graphs of reducible hereditary properties. - Peter Mihók; Riste Skrekovski (Discuss. Math. Graph Theory, 2001)

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

Planar Graphs Without Cycles of Specific Lengths. - Gasper Fijavz; Martin Juvan; Bojan Mohar; Riste Skrekovski (Eur. J. Comb., 2002)

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

On the critical point-arboricity graphs. - Riste Skrekovski (J. Graph Theory, 2002)

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

The Petersen graph is not 3-edge-colorable–a new proof. - Reza Naserasr; Riste Skrekovski (Discret. Math., 2003)

Hajós' theorem for list colorings of hypergraphs. - Claude Benzaken; Sylvain Gravier; Riste Skrekovski (Discuss. Math. Graph Theory, 2003)

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

A theorem on integer flows on cartesian products of graphs. - Wilfried Imrich; Riste Skrekovski (J. Graph Theory, 2003)

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9. - Bojan Mohar; Riste Skrekovski; Heinz-Jürgen Voss (J. Graph Theory, 2003)

A Theorem about the Channel Assignment Problem. - Daniel Král; Riste Skrekovski (SIAM J. Discret. Math., 2003)

Heavy paths, light stars, and big melons. - Tomás Madaras; Riste Skrekovski (Discret. Math., 2004)

Borodin's conjecture on diagonal coloring is false. - Daniel Král; Riste Skrekovski (Eur. J. Comb., 2004)

A revival of the girth conjecture. - Tomás Kaiser; Daniel Král; Riste Skrekovski (J. Comb. Theory B, 2004)

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. - Thomas Böhme 001; Bojan Mohar; Riste Skrekovski; Michael Stiebitz (J. Graph Theory, 2004)

Planar graph colorings without short monochromatic cycles. - Tomás Kaiser; Riste Skrekovski (J. Graph Theory, 2004)

Generalized list T-colorings of cycles. - Jirí Fiala 001; Riste Skrekovski (Discret. Appl. Math., 2005)

Nowhere-zero 3-flows in abelian Cayley graphs. - Primoz Potocnik; Martin Skoviera; Riste Skrekovski (Discret. Math., 2005)

Coloring face hypergraphs on surfaces. - Zdenek Dvorák 001; Daniel Král; Riste Skrekovski (Eur. J. Comb., 2005)

Cyclic, diagonal and facial colorings. - Daniel Král; Tomás Madaras; Riste Skrekovski (Eur. J. Comb., 2005)

Nordhaus-Gaddum-type Theorems for decompositions into many parts. - Zoltán Füredi; Alexandr V. Kostochka; Riste Skrekovski; Michael Stiebitz; Douglas B. West (J. Graph Theory, 2005)

A Brooks-Type Theorem for the Generalized List T-Coloring. - Jirí Fiala 001; Daniel Král; Riste Skrekovski (SIAM J. Discret. Math., 2005)

Colorings Of Plane Graphs With No Rainbow Faces. - Veselin Jungic; Daniel Král; Riste Skrekovski (Comb., 2006)

3-facial colouring of plane graphs - Frédéric Havet; Jean-Sébastien Sereni; Riste Skrekovski (CoRR, 2006)

A map colour theorem for the union of graphs. - Michael Stiebitz; Riste Skrekovski (J. Comb. Theory B, 2006)

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

The last excluded case of Dirac's map-color theorem for choosability. - Daniel Král; Riste Skrekovski (J. Graph Theory, 2006)

A Theorem About a Contractible and Light Edge. - Zdenek Dvorák 001; Riste Skrekovski (SIAM J. Discret. Math., 2006)

Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. - Daniel Král; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2006)

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

Four gravity results. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (Discret. Math., 2007)

Lightness, heaviness and gravity. - Tomás Madaras; Riste Skrekovski (Discret. Math., 2007)

The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. - Tomás Madaras; Riste Skrekovski; Heinz-Jürgen Voss (Discret. Math., 2007)

Cyclic, diagonal and facial colorings - a missing case. - Daniel Král; Tomás Madaras; Riste Skrekovski (Eur. J. Comb., 2007)

The circular chromatic index of graphs of high girth. - Tomás Kaiser; Daniel Král; Riste Skrekovski; Xuding Zhu (J. Comb. Theory B, 2007)

T-joins intersecting small edge-cuts in graphs. - Tomás Kaiser; Riste Skrekovski (J. Graph Theory, 2007)

A Generalization of Kotzig's Theorem and Its Application. - Richard Cole 001; Lukasz Kowalik; Riste Skrekovski (SIAM J. Discret. Math., 2007)

Coloring squares of planar graphs with girth six. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Eur. J. Comb., 2008)

List-Coloring Squares of Sparse Subcubic Graphs. - Zdenek Dvorák 001; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2008)

Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph. - Zdenek Dvorák 001; Riste Skrekovski; Tomás Valla (SIAM J. Discret. Math., 2008)

3-Facial Coloring of Plane Graphs. - Frédéric Havet; Jean-Sébastien Sereni; Riste Skrekovski (SIAM J. Discret. Math., 2008)

Cycles Intersecting Edge-Cuts of Prescribed Sizes. - Tomás Kaiser; Riste Skrekovski (SIAM J. Discret. Math., 2008)

Total-Coloring of Plane Graphs with Maximum Degree Nine. - Lukasz Kowalik; Jean-Sébastien Sereni; Riste Skrekovski (SIAM J. Discret. Math., 2008)

Gray Code Compression. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (IWOCA, 2009)

Distance constrained labelings of planar graphs with no short cycles. - Zdenek Dvorák 001; Daniel Král; Pavel Nejedlý; Riste Skrekovski (Discret. Appl. Math., 2009)

Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Discret. Math., 2009)

Injective colorings of planar graphs with few colors. - Borut Luzar; Riste Skrekovski; Martin Tancer (Discret. Math., 2009)

Homomorphisms of triangle-free graphs without a K5-minor. - Reza Naserasr; Yared Nigussie; Riste Skrekovski (Discret. Math., 2009)

Gray Codes Avoiding Matchings. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2009)

Long cycles in hypercubes with distant faulty vertices. - Petr Gregor; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2009)

k-Chromatic Number of Graphs on Surfaces. - Zdenek Dvorák 001; Riste Skrekovski (SIAM J. Discret. Math., 2009)

Backbone Colorings and Generalized Mycielski Graphs. - Jozef Miskuf; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2009)

Dichotomy for Coloring of Dart Graphs. - Martin Kochol; Riste Skrekovski (IWOCA, 2010)

Backbone colorings of graphs with bounded degree. - Jozef Miskuf; Riste Skrekovski; Martin Tancer (Discret. Appl. Math., 2010)

An improved bound on the largest induced forests for triangle-free planar graphs. - Lukasz Kowalik; Borut Luzar; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2010)

An improved linear bound on the number of perfect matchings in cubic graphs. - Louis Esperet; Daniel Král'; Petr Skoda 002; Riste Skrekovski (Eur. J. Comb., 2010)

Facial colorings using Hall's Theorem. - Frédéric Havet; Daniel Král'; Jean-Sébastien Sereni; Riste Skrekovski (Eur. J. Comb., 2010)

On generalized middle-level problem. - Petr Gregor; Riste Skrekovski (Inf. Sci., 2010)

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. - Zdenek Dvorák 001; Daniel Král'; Riste Skrekovski (J. Graph Theory, 2010)

3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (SIAM J. Discret. Math., 2010)

On the Zagreb index inequality of graphs with prescribed vertex degrees. - Vesna Andova; Saso Bogoev; Darko Dimitrov; Marcin Pilipczuk; Riste Skrekovski (Discret. Appl. Math., 2011)

Randić index and the diameter of a graph. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Eur. J. Comb., 2011)

On the queue-number of the hypercube. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Electron. Notes Discret. Math., 2011)

Graphs with Two Crossings Are 5-Choosable. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (SIAM J. Discret. Math., 2011)

Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. - Tomás Kaiser; Ondrej Rucký; Riste Skrekovski (SIAM J. Discret. Math., 2011)

On the 2-Resonance of Fullerenes. - Tomás Kaiser; Matej Stehlík; Riste Skrekovski (SIAM J. Discret. Math., 2011)

A note on Zagreb indices inequality for trees and unicyclic graphs. - Vesna Andova; Nathann Cohen; Riste Skrekovski (Ars Math. Contemp., 2012)

Some remarks on inverse Wiener index problem. - Jirí Fink; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2012)

Acyclic edge coloring of planar graphs with Δ colors. - Dávid Hudák; Frantisek Kardos; Borut Luzar; Roman Soták; Riste Skrekovski (Discret. Appl. Math., 2012)

The Wiener index in iterated line graphs. - Martin Knor; Primoz Potocnik; Riste Skrekovski (Discret. Appl. Math., 2012)

Some results on Vizing's conjecture and related problems. - Marcin Pilipczuk; Michal Pilipczuk; Riste Skrekovski (Discret. Appl. Math., 2012)

On a conjecture about Wiener index in iterated line graphs of trees. - Martin Knor; Primoz Potocnik; Riste Skrekovski (Discret. Math., 2012)

Hyperbolic analogues of fullerenes on orientable surfaces. - Mathieu Dutour Sikiric; Martin Knor; Primoz Potocnik; Jozef Sirán; Riste Skrekovski (Discret. Math., 2012)

Parity vertex colorings of binomial trees. - Petr Gregor; Riste Skrekovski (Discuss. Math. Graph Theory, 2012)

Bipartizing fullerenes. - Zdenek Dvorák 001; Bernard Lidický; Riste Skrekovski (Eur. J. Comb., 2012)

Brooksʼ Theorem for generalized dart graphs. - Martin Kochol; Riste Skrekovski (Inf. Process. Lett., 2012)

Queue Layouts of Hypercubes. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (SIAM J. Discret. Math., 2012)

On a variation of the Randíc index. - Vesna Andova; Martin Knor; Primoz Potocnik; Riste Skrekovski (Australas. J Comb., 2013)

Wiener index of iterated line graphs of trees homeomorphic to the claw K1, 3. - Martin Knor; Primoz Potocnik; Riste Skrekovski (Ars Math. Contemp., 2013)

Wiener index of iterated line graphs of trees homeomorphic to. - Martin Knor; Primoz Potocnik; Riste Skrekovski (Discret. Math., 2013)

Improved bound on facial parity edge coloring. - Borut Luzar; Riste Skrekovski (Discret. Math., 2013)

A bound on the number of perfect matchings in Klee-graphs. - Marek Cygan; Marcin Pilipczuk; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2013)

Linear time construction of a compressed Gray code. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Eur. J. Comb., 2013)

Line graph operation and small worlds. - Jelena Govorcin; Martin Knor; Riste Skrekovski (Inf. Process. Lett., 2013)

On the mutually independent Hamiltonian cycles in faulty hypercubes. - Vida Vukasinovic; Petr Gregor; Riste Skrekovski (Inf. Sci., 2013)

Wiener index of generalized 4-stars and of their quadratic line graphs. - Martin Knor; Riste Skrekovski (Australas. J Comb., 2014)

Choosability of the square of a planar graph with maximum degree four. - Daniel W. Cranston; Rok Erman; Riste Skrekovski (Australas. J Comb., 2014)

Modeling acquaintance networks based on balance theory. - Vida Vukasinovic; Jurij Silc; Riste Skrekovski (Int. J. Appl. Math. Comput. Sci., 2014)

On the connectivity of Cartesian product of graphs. - Jelena Govorcin; Riste Skrekovski (Ars Math. Contemp., 2014)

Sufficient sparseness conditions for G2 to be (Δ+1)-choosable, when Δ≥5. - Daniel W. Cranston; Riste Skrekovski (Discret. Appl. Math., 2014)

Complete solution of equation W(L3(T))=W(T) for the Wiener index of iterated line graphs of trees. - Martin Knor; Martin Macaj; Primoz Potocnik; Riste Skrekovski (Discret. Appl. Math., 2014)

Relationship between the edge-Wiener index and the Gutman index of a graph. - Martin Knor; Primoz Potocnik; Riste Skrekovski (Discret. Appl. Math., 2014)

Strong edge-coloring of planar graphs. - Dávid Hudák; Borut Luzar; Roman Soták; Riste Skrekovski (Discret. Math., 2014)

Strong parity vertex coloring of plane graphs. - Tomás Kaiser; Ondrej Rucký; Matej Stehlík; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2014)

Replication in critical graphs and the persistence of monomial ideals. - Tomás Kaiser; Matej Stehlík; Riste Skrekovski (J. Comb. Theory A, 2014)

Rooted level-disjoint partitions of Cartesian products. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Appl. Math. Comput., 2015)

An inequality between the edge-Wiener index and the Wiener index of a graph. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2015)

Comparing the irregularity and the total irregularity of graphs. - Darko Dimitrov; Riste Skrekovski (Ars Math. Contemp., 2015)

Odd edge coloring of graphs. - Borut Luzar; Mirko Petrusevski; Riste Skrekovski (Ars Math. Contemp., 2015)

Counterexamples to a conjecture on injective colorings. - Borut Luzar; Riste Skrekovski (Ars Math. Contemp., 2015)

Sandwiching the (generalized) Randić index. - Martin Knor; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2015)

Group centralization of network indices. - Matjaz Krnc; Riste Skrekovski (Discret. Appl. Math., 2015)

l-facial edge colorings of graphs. - Borut Luzar; Martina Mockovciaková; Roman Soták; Riste Skrekovski; Peter Sugerek (Discret. Appl. Math., 2015)

Centralization of transmission in networks. - Matjaz Krnc; Riste Skrekovski (Discret. Math., 2015)

Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (COCOA, 2016)

Some remarks on Wiener index of oriented graphs. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2016)

Digraphs with large maximum Wiener index. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2016)

A search for the minimum value of Balaban index. - Martin Knor; Jaka Kranjc; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2016)

Mathematical aspects of fullerenes. - Vesna Andova; Frantisek Kardos; Riste Skrekovski (Ars Math. Contemp., 2016)

Odd edge-colorability of subcubic graphs. - Risto Atanasov; Mirko Petrusevski; Riste Skrekovski (Ars Math. Contemp., 2016)

Mathematical aspects of Wiener index. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Ars Math. Contemp., 2016)

Remarks on the maximum atom-bond connectivity index of graphs with given parameters. - Darko Dimitrov; Barbara Ikica; Riste Skrekovski (CoRR, 2016)

A measure for a balanced workload and its extremal values. - Jelena Govorcin; Riste Skrekovski; Vida Vukasinovic; Damir Vukicevic (Discret. Appl. Math., 2016)

Orientations of graphs with maximum Wiener index. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Discret. Appl. Math., 2016)

Mapping planar graphs into the Coxeter graph. - Ararat Harutyunyan; Reza Naserasr; Mirko Petrusevski; Riste Skrekovski; Qiang Sun (Discret. Math., 2016)

Star Edge Coloring of Some Classes of Graphs. - L'udmila Bezegová; Borut Luzar; Martina Mockovciaková; Roman Soták; Riste Skrekovski (J. Graph Theory, 2016)

Closeness centralization measure for two-mode data of prescribed sizes. - Matjaz Krnc; Jean-Sébastien Sereni; Riste Skrekovski; Zelealem B. Yilma (Netw. Sci., 2016)

Leapfrog fullerenes and Wiener index. - Vesna Andova; Damir Orlic; Riste Skrekovski (Appl. Math. Comput., 2017)

On the difference between the Szeged and the Wiener index. - Marthe Bonamy; Martin Knor; Borut Luzar; Alexandre Pinlou; Riste Skrekovski (Appl. Math. Comput., 2017)

Remarks on the Graovac-Ghorbani index of bipartite graphs. - Darko Dimitrov; Barbara Ikica; Riste Skrekovski (Appl. Math. Comput., 2017)

On the minimum value of sum-Balaban index. - Martin Knor; Jaka Kranjc; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2017)

A note on acyclic number of planar graphs. - Mirko Petrusevski; Riste Skrekovski (Ars Math. Contemp., 2017)

Relative edge betweenness centrality. - Damir Vukicevic; Riste Skrekovski; Aleksandra Tepeh (Ars Math. Contemp., 2017)

Remarks on maximum atom-bond connectivity index with given graph parameters. - Darko Dimitrov; Barbara Ikica; Riste Skrekovski (Discret. Appl. Math., 2017)

On a conjecture about the ratio of Wiener index in iterated line graphs. - Martin Knor; Katarína Hrináková; Riste Skrekovski (Art Discret. Appl. Math., 2018)

Modelling simultaneous broadcasting by level-disjoint partitions. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Appl. Math. Comput., 2018)

Graphs preserving Wiener index upon vertex removal. - Martin Knor; Snjezana Majstorovic; Riste Skrekovski (Appl. Math. Comput., 2018)

Extending Perfect Matchings to Gray Codes with Prescribed Ends. - Petr Gregor; Tomás Novotný; Riste Skrekovski (Electron. J. Comb., 2018)

On facial unique-maximum (edge-)coloring. - Vesna Andova; Bernard Lidický; Borut Luzar; Riste Skrekovski (Discret. Appl. Math., 2018)

Graphs whose Wiener index does not change when a specific vertex is removed. - Martin Knor; Snjezana Majstorovic; Riste Skrekovski (Discret. Appl. Math., 2018)

A counterexample to a conjecture on facial unique-maximal colorings. - Bernard Lidický; Kacy Messerschmidt; Riste Skrekovski (Discret. Appl. Math., 2018)

Graphs preserving total distance upon vertex removal. - Snjezana Majstorovic; Martin Knor; Riste Skrekovski (Electron. Notes Discret. Math., 2018)

Broadcasting multiple messages in the 1-in port model in optimal time. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (J. Comb. Optim., 2018)

On vertex-parity edge-colorings. - Borut Luzar; Mirko Petrusevski; Riste Skrekovski (J. Comb. Optim., 2018)

Remarks on Multiplicative Atom-Bond Connectivity Index. - Riste Skrekovski; Darko Dimitrov; Jiemei Zhong; Hualong Wu; Wei Gao 012 (IEEE Access, 2019)

An inequality between variable wiener index and variable szeged index. - Katarína Hrináková; Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2019)

On the minimum distance in a k-vertex set in a graph. - Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2019)

Trees with the maximal value of Graovac-Pisanski index. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Appl. Math. Comput., 2019)

Graphs with a given diameter that maximise the Wiener index. - Qiang Sun; Barbara Ikica; Riste Skrekovski; Vida Vukasinovic (Appl. Math. Comput., 2019)

Total positivity of Toeplitz matrices of recursive hypersequences. - Tomislav Doslic; Ivica Martinjak; Riste Skrekovski (Ars Math. Contemp., 2019)

Unicyclic graphs with the maximal value of Graovac-Pisanski index. - Martin Knor; Jozef Komorník; Riste Skrekovski; Aleksandra Tepeh (Ars Math. Contemp., 2019)

On Extremal Graphs of Weighted Szeged Index. - Jan Bok; Boris Furtula; Nikola Jedlicková; Riste Skrekovski (CoRR, 2019)

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (CoRR, 2019)

Maximum external Wiener index of graphs. - Darko Dimitrov; Barbara Ikica; Riste Skrekovski (Discret. Appl. Math., 2019)

Facial unique-maximum colorings of plane graphs with restriction on big vertices. - Bernard Lidický; Kacy Messerschmidt; Riste Skrekovski (Discret. Math., 2019)

Coverability of graph by three odd subgraphs. - Mirko Petrusevski; Riste Skrekovski (J. Graph Theory, 2019)

Redundant binary representations with rigorous trade-off between connectivity and locality. - Vida Vukasinovic; David Kubon; Riste Skrekovski; Petr Gregor (GECCO Companion, 2020)

Some remarks on Balaban and sum-Balaban index. - Martin Knor; Jozef Komorník; Riste Skrekovski; Aleksandra Tepeh (Art Discret. Appl. Math., 2020)

Maximal Wiener index for graphs with prescribed number of blocks. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2020)

Variations on the Petersen Colouring Conjecture. - François Pirot; Jean-Sébastien Sereni; Riste Skrekovski (Electron. J. Comb., 2020)

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (Discret. Appl. Math., 2020)

Eccentricity of networks with structural constraints. - Matjaz Krnc; Jean-Sébastien Sereni; Riste Skrekovski; Zelealem B. Yilma (Discuss. Math. Graph Theory, 2020)

The structure of graphs with given number of blocks and the maximum Wiener index. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (J. Comb. Optim., 2020)

Trees with Minimum Weighted Szeged Index Are of a Large Diameter. - Risto Atanasov; Boris Furtula; Riste Skrekovski (Symmetry, 2020)

Remarks on Distance Based Topological Indices for ℓ-Apex Trees. - Martin Knor; Muhammad Imran 006; Muhammad Kamran Jamil; Riste Skrekovski (Symmetry, 2020)

Graphs with the edge metric dimension smaller than the metric dimension. - Martin Knor; Snjezana Majstorovic; Aoden Teo Masa Toshi; Riste Skrekovski; Ismael G. Yero (Appl. Math. Comput., 2021)

Bounds on metric dimensions of graphs with edge disjoint cycles. - Jelena Sedlar; Riste Skrekovski (Appl. Math. Comput., 2021)

Extremal mixed metric dimension with respect to the cyclomatic number. - Jelena Sedlar; Riste Skrekovski (Appl. Math. Comput., 2021)

Arithmetic-geometric index and its relations with geometric-arithmetic index. - Sasa Vujosevic; Goran Popivoda; Zana Kovijanic Vukicevic; Boris Furtula; Riste Skrekovski (Appl. Math. Comput., 2021)

Statistics of Knowledge Graphs Based On The Conceptual Schema. - Iztok Savnik; Kiyoshi Nitta; Riste Skrekovski; Nikolaus Augsten (CoRR, 2021)

Mixed metric dimension of graphs with edge disjoint cycles. - Jelena Sedlar; Riste Skrekovski (Discret. Appl. Math., 2021)

Bounding the k-rainbow total domination number. - Kerry Ojakian; Riste Skrekovski; Aleksandra Tepeh (Discret. Math., 2021)

Odd decompositions and coverings of graphs. - Mirko Petrusevski; Riste Skrekovski (Eur. J. Comb., 2021)

Domination versus independent domination in regular graphs. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (J. Graph Theory, 2021)

Statistics of RDF Store for Querying Knowledge Graphs. - Iztok Savnik; Kiyoshi Nitta; Riste Skrekovski; Nikolaus Augsten (FoIKS, 2022)

On 12-regular nut graphs. - Nino Basic; Martin Knor; Riste Skrekovski (Art Discret. Appl. Math., 2022)

Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two. - Jelena Sedlar; Riste Skrekovski (Appl. Math. Comput., 2022)

Notes on weak-odd edge colorings of digraphs. - César Hernández-Cruz; Mirko Petrusevski; Riste Skrekovski (Ars Math. Contemp., 2022)

Remarks on odd colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski (Discret. Appl. Math., 2022)

A note on the metric and edge metric dimensions of 2-connected graphs. - Martin Knor; Riste Skrekovski; Ismael G. Yero (Discret. Appl. Math., 2022)

Colorings with neighborhood parity condition. - Mirko Petrusevski; Riste Skrekovski (Discret. Appl. Math., 2022)

Vertex and edge metric dimensions of unicyclic graphs. - Jelena Sedlar; Riste Skrekovski (Discret. Appl. Math., 2022)

Vertex and edge metric dimensions of cacti. - Jelena Sedlar; Riste Skrekovski (Discret. Appl. Math., 2022)

Evaluating group degree centrality and centralization in networks. - Mario Karlovcec; Matjaz Krnc; Riste Skrekovski (Informatica (Slovenia), 2022)

Multiset-trie data structure - datasets. - Mikita Akulich; Iztok Savnik; Matjaz Krnc; Riste Skrekovski (Zenodo, 2022)

On metric dimensions of hypercubes. - Aleksander Kelenc; Aoden Teo Masa Toshi; Riste Skrekovski; Ismael G. Yero (Ars Math. Contemp., 2022)

Remarks on proper conflict-free colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski (Discret. Math., 2023)

On maximum Wiener index of directed grids. - Martin Knor; Riste Skrekovski (Art Discret. Appl. Math., 2023)

Multiset-Trie Data Structure. - Mikita Akulich; Iztok Savnik; Matjaz Krnc; Riste Skrekovski (Algorithms, 2023)

Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. - Reza Naserasr; Riste Skrekovski; Zhouningxin Wang; Rongxing Xu (J. Graph Theory, 2023)

Odd edge-colorings of subdivisions of odd graphs. - Mirko Petrusevski; Riste Skrekovski (J. Graph Theory, 2023)

Selected topics on Wiener index. - Martin Knor; Riste Skrekovski; Aleksandra Tepeh (Ars Math. Contemp., 2024)

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks. - Jelena Sedlar; Riste Skrekovski (Eur. J. Comb., 2024)

Local Irregularity Conjecture vs. cacti. - Jelena Sedlar; Riste Skrekovski (Discret. Appl. Math., 2024)

Diameter of nanotori. - Vesna Andova; Pavel Dimovski; Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2024)

Proper edge-colorings with a rich neighbor requirement. - Mirko Petrusevski; Riste Skrekovski (Discret. Math., 2024)

Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph. - Jelena Sedlar; Riste Skrekovski (Appl. Math. Comput., 2024)

Resolving vertices of graphs with differences. - Iztok Peterin; Jelena Sedlar; Riste Skrekovski; Ismael G. Yero (Comput. Appl. Math., 2024)

Criticality in Sperner's Lemma. - Tomás Kaiser; Matej Stehlík; Riste Skrekovski (Comb., 2024)

Extremizing antiregular graphs by modifying total σ-irregularity. - Martin Knor; Riste Skrekovski; Slobodan Filipovski; Darko Dimitrov (Appl. Math. Comput., 2025)

On regular graphs with Šoltés vertices. - Nino Basic; Martin Knor; Riste Skrekovski (Ars Math. Contemp., 2025)

On strong odd colorings of graphs. - Yair Caro; Mirko Petrusevski; Riste Skrekovski; Zsolt Tuza (Discret. Math., 2025)

Domination number of modular product graphs. - Sergio Bermudo; Iztok Peterin; Jelena Sedlar; Riste Skrekovski (Comput. Appl. Math., 2025)

Invitation to the subpath number. - Martin Knor; Jelena Sedlar; Riste Skrekovski; Yu Yang (Appl. Math. Comput., 2026)