Author

R. Škrekovski

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

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

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} $\mathrm{fd}(G)$ is the minimum cardinality of such a set. Caro, Hansberg and Henning, who introduced this parameter, proved that $\mathrm...

Y. Caro, R. Škrekovski · 0 citations

Preprint Sep 2026

Spreads of degrees in graphs

For a graph $G$ and a set $B\subseteq V(G)$, the spread $\mathrm{sp}(B)$ of $B$ is the difference between the largest and the smallest degree in $G$ of a vertex of $B$, and for an integer $k\geq0$ the parameter $\mathrm{sp}(G,k)$ is the largest cardinality of a set $B$ with $\mathrm{sp}(B)\leq k$. Caro, Lauri and Zarb...

Y. Caro, R. Škrekovski, Christina Zarb · 0 citations