48 citations · 253 across the 49 of their papers we have counts for
5 papers · 1 filter
Local Irregularity Conjecture vs. cacti
Jelena Sedlar, Riste Škrekovski
A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irre…
Remarks on the vertex and the edge metric dimension of 2-connected graphs
Martin Knor, Jelena Sedlar, Riste Škrekovski
The vertex (resp. edge) metric dimension of a graph G is the size of a smallest vertex set in G which distinguishes all pairs of vertices (resp. edges) in G and it is denoted by di…
Remarks on proper conflict-free colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A vertex coloring of a graph is said to be \textit{conflict-free} with respect to neighborhoods if for every non-isolated vertex there is a color appearing exactly once in its (ope…
On maximum Wiener index of directed grids
Martin Knor, Riste Skrekovski
This paper is devoted to Wiener index of directed graphs, more precisely of directed grids. The grid is the Cartesian product of paths on and vertic…
Remarks on odd colorings of graphs
Yair Caro, Mirko Petruševski, Riste Škrekovski
A proper vertex coloring of graph is said to be odd if for each non-isolated vertex there exists a color such that is odd-sized. The mi…