48 citations · 253 across the 49 of their papers we have counts for
6 papers · 1 filter
Resolving vertices of graphs with differences
Iztok Peterina, Jelena Sedlar, Riste Škrekovski +1
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances t…
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
Jelena Sedlar, Riste Škrekovski
An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edg…
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
Jelena Sedlar, Riste Škrekovski
In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich (resp. poor) if the number of colors of all edges incident to end-vertices of e is 5 (resp. 3). An edge-…
Selected topics on Wiener index
Martin Knor, Riste Škrekovski, Aleksandra Tepeh
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, wh…
On regular graphs with Šoltés vertices
Nino Bašić, Martin Knor, Riste Škrekovski
Let be the Wiener index of a graph . We say that a vertex is a Šoltés vertex in if , i.e. the Wiener index does not change if the vertex…
Criticality in Sperner's Lemma
Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski
We answer a question posed by T. Gallai in 1969 concerning criticality in Sperner's lemma, listed as Problem 9.14 in the collection of Jensen and Toft [Graph coloring problems, Joh…