R. Škrekovski

activity

20062026

most citedReplication in critical graphs and the persistence of monomial ideals

48 citations · 253 across the 49 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Spreads of degrees in maximal planar graphs -- an exposition

Yair Caro, Riste Škrekovski, Christina Zarb

For a graph $G$ and a set $B \subseteq V (G)$ , the spread $sp (B)$ of $B$ is the difference between the largest and the smallest degree in $G$ of a vertex of $B$ , and for an…

math.CO2026

An improved upper bound for the fair domination number of maximal outerplanar graphs

Yair Caro, Riste Škrekovski

A dominating set $D$ of a graph $G$ is a \emph{fair dominating set} if every two vertices outside $D$ have the same number of neighbors in $D$ , and the \emph{fair domination number…

math.CO2026

Spreads of degrees in graphs

Yair Caro, Riste Škrekovski, Christina Zarb

For a graph $G$ and a set $B \subseteq V (G)$ , the spread $sp (B)$ of $B$ is the difference between the largest and the smallest degree in $G$ of a vertex of $B$ , and for an…