Riste vSkrekovski

activity

20122026

most citedSandwiching saturation number of fullerene graphs

14 citations · 26 across the 14 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

An odd independent set $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…

math.CO2025

The odd independence number of graphs, I: Foundations and classical classes

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

An odd independent set $S$ in a graph $G = (V, E)$ is an independent set of vertices such that, for every vertex $v \in V ∖ S$ , either $N (v) \cap S = \emptyset$ or $|N(v) \cap…