Riste vSkrekovski

activity

20242026

collaborators

5 papers

math.CO2026

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…

math.CO2026

A note on vertex-critical induced subgraphs of shift graphs

TomÃ¡Å¡ Kaiser, MatÄj StehlÃk, Riste Å krekovski

Shift graphs, introduced by ErdÅs and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. I…

math.CO2026

Degree-choosability of proper conflict-free list coloring of sparse graphs

Masaki Kashima, Riste Å krekovski, Rongxing Xu

Given a graph $G$ and a mapping $f : V (G) \to N$ , an $f$ -list assignment of $G$ is a function that maps each $v \in V (G)$ to a set of at least $f (v)$ colors. For an $f$ -list…

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.CO2024

Some results on $I ¨ _{t}$ -irregularity

Slobodan Filipovski, Darko Dimitrov, Martin Knor +1

The $I ¨ _{t}$ -irregularity (or sigma total index) is a graph invariant which is defined as $I ¨ _{t} (G) = \sum_{{u, v} \subseteq V (G)} (d (u) - d (v))^{2},$ where $d (z)$ denotes the degree o…

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

A note on vertex-critical induced subgraphs of shift graphs

Degree-choosability of proper conflict-free list coloring of sparse graphs

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

Some results on I¨t​-irregularity

Some results on $I ¨ _{t}$ -irregularity